Question

1) Find GCD
a. Using recursion
b. Without recursion

Answer 1

Answer:

1.GCD of Two Numbers using Recursion 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.

2