Objective: Given 2 number m and n, we have to find Greatest Common Divisor.
Approach: Euclid's Algorithm to find Greatest common Divisor. Suppose m and n is two integer, m > n.
1. Get reminder while divide m by n, if it 0 then we have our answer n as GCD.
2. If reminder is not 0, then divide m by n and then get reminder. Thereafter, set reminder to n = r; m = n; and repeat step 1 to get GCD of 'm' and 'n'.
Solution: Java Code
Approach: Euclid's Algorithm to find Greatest common Divisor. Suppose m and n is two integer, m > n.
1. Get reminder while divide m by n, if it 0 then we have our answer n as GCD.
2. If reminder is not 0, then divide m by n and then get reminder. Thereafter, set reminder to n = r; m = n; and repeat step 1 to get GCD of 'm' and 'n'.
Solution: Java Code
No comments:
Post a Comment