Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm
More...
#include <iostream>
#include <stdexcept>
|
int | gcd (int num1, int num2) |
|
int | main () |
|
Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm
- See also
- gcd_recursive_euclidean.cpp, gcd_of_n_numbers.cpp
◆ gcd()
int gcd |
( |
int | num1, |
|
|
int | num2 ) |
algorithm
15 {
16 if (num1 <= 0 | num2 <= 0) {
18 }
19
20 if (num1 == num2) {
21 return num1;
22 }
23
24 int base_num = 0;
25 int previous_remainder = 1;
26
27 if (num1 > num2) {
28 base_num = num1;
29 previous_remainder = num2;
30 } else {
31 base_num = num2;
32 previous_remainder = num1;
33 }
34
35 while ((base_num % previous_remainder) != 0) {
36 int old_base = base_num;
37 base_num = previous_remainder;
38 previous_remainder = old_base % previous_remainder;
39 }
40
41 return previous_remainder;
42}
◆ main()
Main function
47 {
49 try {
53 }
56
57 return 0;
58}
int gcd(int num1, int num2)
Definition gcd_iterative_euclidean.cpp:15