In C language! Write a main.c program to find the greatest common divisor (GCD) of an array of 10 integers. These 10 integers are {64, 16, 36, 24, 8, 32, 72, 144, 48, 72}. Run your codes. The greatest common divisor of two integers is the largest number that can divide these two integers. The Euclid’s algorithm for finding the GCD of two integers is described as follows: find the smaller of the two integers use the smaller value as the divisor and the larger number as the dividend divide the dividend by the divisor obtain the quotient and the remainder if the remainder is not zero, the previous divisor becomes the dividend and the remainder becomes the divisor repeat this division process until the remainder becomes zero when the remainder is zero, the last divisor in the last step is the GCD.
In C language!
Write a main.c program to find the greatest common divisor
(GCD) of an array of 10 integers. These 10 integers are {64, 16, 36, 24, 8, 32, 72, 144,
48, 72}. Run your codes.
The greatest common divisor of two integers is the largest number that can divide
these two integers. The Euclid’s
described as follows:
find the smaller of the two integers
use the smaller value as the divisor and the larger number as the dividend
divide the dividend by the divisor
obtain the quotient and the remainder
if the remainder is not zero, the previous divisor becomes the dividend and
the remainder becomes the divisor
repeat this division process until the remainder becomes zero
when the remainder is zero, the last divisor in the last step is the GCD.
Step by step
Solved in 3 steps with 2 images
