Write pseudocode for computing GCD (m,n) where m=525 and n=125 and calculate worst time complexity of the problem.

Question

Algorithm

Answer 1

by the way:
mod --> modulus operator (in many languages %)
the mod operator calculates the remainder of a division

Answer 2

https://www.sololearn.com/learn/6362/?ref=app

Answer 3

I know the euclidian algorithm to calculate the gcd:
525 mod 125 = 25
125 mod 25 = 0
--> gdc (525,125) = 25
remainder = m mod n
while (remainder != 0)
m = n
n = remainder
remainder = m mod n
end while
print n //remainder is 0 --> n is your gcd
But I don't know how to caculate the time complexity.

Answer 4

Thanks.

Answer 5

I know the GCD. But don't know how to calculate the worst time complexity of this problem.
I have doubt about the last question