Question: This is a GCD algorithm. every time through the loop value of m and n change by a factor of smaller of m , n
This is a GCD algorithm. every time through the loop value of m and n change by a factor of smaller of m n so total number of iterations Oln m
Explain the above or prove it
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
