Java programs for "Algorithms and data Structures" greatest common divisor and least common multiple

Source: Internet
Author: User
Tags gcd greatest common divisor

GCD Greatest Common divisor

Method: Euclid Algorithm (Euclidean method),

"Thought" recursion

Ideas

Code

1  Public classMain {2      Public Static intgcdintPintq) {3         if(q = 0) {4             returnp;5         }6         intr = p%Q;7         returngcd (q, R);8     }9}
LCM Least common multiple

The pursuit of convenient formula method to solve.

Ideas

Code

1  Public classMain {2      Public Static intgcdintPintq) {3         if(q = 0) {4             returnp;5         }6         intr = p%Q;7         returngcd (q, R);8     }9      Public Static intLcmintAintb) {Ten         return(A * b)/gcd (A, b); One     } A}

Java programs for "Algorithms and data Structures" greatest common divisor and least common multiple

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.