Compute(m, n) //Computes gcd(m, n) Input: Two nonnegative, m and n //Output: GCD of m and...

  

Transcribed Image Text:

Compute(m, n) //Computes gcd(m, n) Input: Two nonnegative, m and n //Output: GCD of m and n while n>= 0 do r-m mod n mn nem return m The time complexity is best represented as Compute(m, n) //Computes gcd(m, n) Input: Two nonnegative, m and n //Output: GCD of m and n while n>= 0 do r-m mod n mn nem return m The time complexity is best represented as