FIND GCD OF A NUMBER USING RECURSION IN C PROGRAM

FIND GCD OF A NUMBER USING RECURSION IN C PROGRAM

FIND GCD OF A NUMBER USING RECURSION IN C PROGRAM



Solution:


#include<stdio.h>
int main(){
  int n1,n2,gcd;
  printf("\nEnter two numbers: ");
  scanf("%d %d",&n1,&n2);
  gcd=findgcd(n1,n2);
  printf("\nGCD of %d and %d is: %d",n1,n2,gcd);
  return 0;
}

int findgcd(int x,int y){
     while(x!=y){
          if(x>y)
              return findgcd(x-y,y);
          else
             return findgcd(x,y-x);
     }
     return x;
}

More C Program :


  1. FIND GCD OF A NUMBER USING RECURSION IN C PROGRAM
  2. write a c program to find gcd of two numbers using recursion
  3. gcd program in c without recursion
  4. gcd of two numbers using recursion in java
  5. gcd using recursion in c language
  6. c program to find factorial of a number using recursion
  7. fibonacci using recursion
  8. write a c program for finding gcd of two given numbers
  9. c program to find gcd of two numbers using functions


Learn More :