Complete the following algorithm for calculating gcd(m,n) for m>n.
If n is a divisor or m
The result is n.
Else
The result is gcd(____) .

Question

Complete the following algorithm for calculating gcd(m,n) for m>n. If n is a divisor or m The result is n. Else The result is gcd(____). A) m % n B) n C) n, m % n D) n, m / n

Quizplus · Accepted Answer

The correct completion for the algorithm to calculate the greatest common divisor (gcd) of m and n (for m > n) is "gcd(n, m % n)". This is based on the Euclidean algorithm, which states that the gcd of two numbers also divides their difference. Here, m % n (the remainder of m divided by n) is used to progressively reduce the size of the numbers until the gcd is found.

Complete the Following Algorithm for Calculating gcd(m,n) for M>n