Question

Question:
Let A and B be nonnegative integers. Suppose a function GCD is recursively defined as follows:
GCD (A, B) = {GCD (B, A) if A<B
{ A if B=0
{GCD (B, MOD(A,B)) otherwise

( Here, MOD (A,B), read "A modulo B", denotes the remainder when A is divided by B)

Q:a) Find GCD(6,15)

Q:b) What does this function do?

I solved the question (a), but couldn't solve the problem (b), can anybody please solve it with step by step?​

Answer 1

Answer:

solved the question (a), but couldn't solve the problem (b), can anybody please solve it with

Answer 2

Answer:

GCD

Explanation:

This function gives greatest Common divisor of 6 & 15