C/C++ Program to Find GCD of Two Numbers Using Recursion

In this program we will use recursion and Euclid’s algorithm to find greatest common divisor of two numbers. The definition of Euclid’s algorithm is as follows:

Also Read: C program to find factorial of any number using recursion
Also Read: How to Convert a Recursive Function or Algorithm to Non-Recursive?

C Program

C++ Program

C/C++ Program to Find GCD of Two Numbers Using Recursion

4 thoughts on “C/C++ Program to Find GCD of Two Numbers Using Recursion

  1. junaid kundi

    hoe to write it in coino.h mean not that one which u write above of C++ in simple if or if else statment

    Reply
  2. Prat

    No need of checking greater number, you can get the same result as below:

    int GCD(int a, int b)
    {
    if (a == 0)
    return b;
    return GCD(b%a, a);
    }

    Reply
  3. Rag

    int GCD(int a,int b) {
    if(b<a) return GCD(b,a);
    if(a==0) return b;
    else return GCD(b%a,a);

    Reply
  4. Kavelie

    I wanted to ask whether this website only uses the 2 programming languages only cause I do need to ask other languages. Thank you

    Reply

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.