Write C programs that use both recursive and non-recursive functions. To find the GCD (greatest common divisor) of two given integers.

/* Write C programs that use both recursive and non-recursive functions
  To find the GCD (greatest common divisor) of two given integers.*/

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

unsigned int GcdRecursive(unsigned m, unsigned n);
unsigned int GcdNonRecursive(unsigned p,unsigned q);

int main(void)
{
 int a,b,iGcd;
 clrscr();

 printf("Enter the two numbers whose GCD is to be found: ");
 scanf("%d%d",&a,&b);
For more Click

Written by Unknown

Java Basic Point blog is created for the MCA,M.Tech,B.Tech and Graduate students.So visit and get the benifits from this blog.