C program to GCD by Recursion

Below is C program to Sum of GCD by Recursion .

Program:

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

/* GCD by recursion */   #include<stdio.h> int gcd(int,int);   int main() {  int a,b;  printf("Type 2 values to find GCD :\n");  scanf("%d %d",&a,&b);  printf("GCD : %d",gcd(a,b));  return 0; }   int gcd(int m,int n) {  if(n>m) return gcd(n,m);  if(n==0) return m;  return gcd(n,m%n); }