Write a recursive and non-recursive function to calculate the GCD of two numbers.

1.6kviews

written 7.9 years ago by

teamques10 ★ 65k

• modified 7.9 years ago

Mumbai University > COMPS > Sem 3 > Data Structures

Marks: 5 M

Year: Dec 2014

ADD COMMENT EDIT

1 Answer

3views

written 7.9 years ago by

teamques10 ★ 65k

Here is the recursive function to calculate the GCD of two numbers a and b:-

intgcd(int a, int b){
while(a != b)
        if(a > b) return gcd(a-b, b);
        else return gcd(a, b-a)
    return a;
}

Here is the non-recursive version:-

int gcd(int a, int b){
    while(a != b)
        if (a …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.