C Example for Beginners: C Program to Find G.C.D Using Recursion

(C programming Example for Beginners)

C Program to Find G.C.D Using Recursion

In this example, you will learn to find the GCD (Greatest Common Divisor) of two positive integers entered by the user using recursion.

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


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.

In this program, recursive calls are made until the value of n2 is equal to 0.



C Example for Beginners: C Program to Find G.C.D Using Recursion

Sign up to get end-to-end “Learn By Coding” example.

Disclaimer: The information and code presented within this recipe/tutorial is only for educational and coaching purposes for beginners and developers. Anyone can practice and apply the recipe/tutorial presented here, but the reader is taking full responsibility for his/her actions. The author (content curator) of this recipe (code / program) has made every effort to ensure the accuracy of the information was correct at time of publication. The author (content curator) does not assume and hereby disclaims any liability to any party for any loss, damage, or disruption caused by errors or omissions, whether such errors or omissions result from accident, negligence, or any other cause. The information presented here could also be found in public knowledge domains.