Google

Program to compute GCD of given two numbers x and y

Written on:October 2, 2012
Comments are closed

Recursion

Program to compute GCD of given two numbers x and y

#include <stdio.h>
#include <conio.h>

/*Recursive function to compute GCD*/
int GCD(int x,int y)
{
if(y==0)
return x;
else if(x<y)
return GCD(y,x);
else
return GCD(y,x%y);
}

void main()
{
int x,y,res;
clrscr();
printf(“nEnter first number?”);
scanf(“%d”,&x);
printf(“nEnter second number?”);
scanf(“%d”,&y);
res=GCD(x,y);
printf(“nGCD of %d and %d is %d”,x,y,res);
getch();
}

 

 

Sorry, the comment form is closed at this time.