A Euclidian algorithm finds the gcd of two positive integers a and b. If the two parameters of the method are dividend and divisor, identify when you will have reached the base case.

Question

Quizplus · Accepted Answer

The Answer of A Euclidian algorithm finds the gcd of two positive integers a and b. If the two parameters of the method are dividend and divisor, identify when you will have reached the base case.

A Euclidian Algorithm Finds the Gcd of Two Positive Integers