Q17 Write a function to compute the greatest common divisor given by Euclid’s algorithm, exemplified for J=1980, K=1617 as follows: Thus, the greatest common divisor is 33.
Program: 138 Write a C function to compute the greatest common divisor given by Euclid’s algorithm, exemplified for J=1980, K=1617
Read More