Find GCD using recursion | C program

Write a C Program to find GCD of two user given number using recursion , C program :

Code:


#include<stdio.h>
void main()
{
    int gcd(int ,int);
    int n,b,a;
    printf("Enter two  number:\n");
    scanf("%d%d",&a,&b);
    n=gcd(a,b);
    printf("%d",n);
}
int gcd(int a,int b)
{
    if(a==b)
        return a;
    else if(a%b==0)
        return b;
    else if(b%a==0)
        return a;
    else if(a>b)
        return(gcd(a%b,b));
    else
        return(gcd(a,b%a));
}

Output: 

Comments

Post a Comment

Give your feedback!
DO NOT SPAM !!
NO THIRD PARTY PROMOTIONAL LINK !!!! (else comment will be deleted.)

Popular posts from this blog

Find Factorial using Recursion | C Program:

Image
Write a C Program to Find Factorial User given using Recursion :   About factorial: 5! = 5!x4!x3!x2!x1! = 120 Code: #include<stdio.h> void main() { int facto(int); int n,b; printf("Enter a range of factorial:\n"); scanf("%d",&n); b=facto(n); printf("\nThe factorial of %d is %d",n,b); } int facto(int n) { if(n==1) return n; else n=n*facto(n-1); return n; } Output:
Read more

Write a C-program to swap two number:

Image
Swap Two Number: Tips:  1.Take three variables.  2.Take two inputs from user.  3.Assign variables one by one each other. Code: main() {     int a,b,s;     printf("Enter two number two swap:\n");     scanf("%d%d",&a,&b);     printf("\nyou decide:\na=%d and b=%d",a,b);     getch(0);     s=a;     a=b;     b=s;     printf("\nThe swap number is: a=%d and b=%d",a,b);     getch(); } Output:   Please comment!
Read more