Programming Example

GCD of Two Numbers using Recursion

👁 1,211 Views

💻 Practical Program

📘 Step by Step Learning

GCD of Two Numbers using Recursion: This program takes two positive integers as input from the user and calculates GCD using recursion.

Program Code

#include <stdio.h>
int hcf(int n1, int n2);
int main()
{
   int n1, n2;
   printf("Enter two positive integers: ");
   scanf("%d %d", &n1, &n2);

   printf("G.C.D of %d and %d is %d.", n1, n2, hcf(n1,n2));
   return 0;
}

int hcf(int n1, int n2)
{
    if (n2 != 0)
       return hcf(n2, n1%n2);
    else 
       return n1;
}

Output

Enter two positive integers: 366
60
G.C.D of 366 and 60 is 6.

Explanation

None

How to learn from this program

First read the algorithm, then study the program code line by line. After that, compare the code with the output and finally go through the explanation. This approach helps learners understand both the logic and the implementation properly.

Practice suggestion

After understanding this example, try to rewrite the same program without looking at the code. Then change some values or logic and run it again. This helps improve confidence and keeps learners engaged on the page for longer.