Home / Programs / GCD of Two Numbers using Recursion
🚀 Programming Example

GCD of Two Numbers using Recursion

👁 1,211 Views
💻 Practical Program
📘 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;
} 
                        

🖥 Program Output

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

📘 Explanation

None
📚 Learning Subject

Master Programming Through Practical Examples

Improve your coding logic, problem-solving skills and programming confidence by practicing real-world examples with explanations.

🎯 How to learn from this example

First understand the algorithm carefully. Then study the program line-by-line and compare it with the output. Finally, review the explanation section to strengthen your logic and programming understanding.

🔥 Practice suggestion

Rewrite the program without looking at the code. Modify values, conditions or logic and run it again. This helps improve confidence and strengthens coding skills much faster.