a. What is the minimum number of divisions made by Euclid’s algorithm among all inputs 1≤ m, n ≤ 10?
b. What is the maximum number of divisions made by Euclid’s algorithm among all inputs 1≤ m, n ≤ 10?
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.