Tutorials and Mini Projects of C, C++, PHP, OpenGL, and other languages with C/C++ codes of Data Structure, Numerical Methods and Computer Graphics
by Programming Techniques · Published · Updated
Euclid’s algorithm calculates the GCD (Greatest Common Divisor) for two numbers a and b. The following C program uses recursion to get the GCD.
The code is also available on GitHub.
#include <stdio.h>
int euclid(int a, int b) {
if (b == 0) {
return a;
} else {
return euclid(b, a % b);
}
}
int main(int argc, char* argv[]) {
int a = 30, b = 21;
printf("GCD is %d\n", euclid(a, b));
return 0;
}
by Programming Techniques · Published August 7, 2011 · Last modified January 29, 2019
by Programming Techniques · Published January 28, 2012 · Last modified January 31, 2019
by Programming Techniques · Published August 22, 2011 · Last modified January 30, 2019
