fastread homefastrread library fastread menu

C : Find G.C.D Using Recursion

Tutorial by:Manisha Dubey      Date: 2016-06-17 03:53:08

❰ Previous Next ❱

Example to find the GCD of two positive integers (entered by the user) using recursion in C programming.

This program takes two positive integers as input from the user and calculates GCD using recursion.


Example: GCD of Two Numbers using Recursion

#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);
       return n1;



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

❰ Previous Next ❱


Submit Your Thought, Tutorial, Articls etc.

Submit Your Information India's Number one online promotion website