8 lines
145 B
C++
8 lines
145 B
C++
int greatest_common_divisor(int num1, int num2) {
|
|
while (num2 != 0) {
|
|
int temp = num2;
|
|
num2 = num1 % num2;
|
|
num1 = temp;
|
|
}
|
|
return num1;
|
|
} |