This program takes two positive integers as input from the user and calculates GCD using recursion.
Visit this page to learn how you can calculate the GCD using loops.
GCD of Two Numbers using Recursion
Output
Enter two positive integers: 366 60 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.