Question 3. Consider the following algorithm procedure Algorithm1(a;b: positive integers) while a 0 do begin if...

Transcribed Image Text:

Question 3. Consider the following algorithm procedure Algorithm1(a;b: positive integers) while a 0 do begin if ab then a = a - b else interchange a and b end output b (a) Step by step, execute the algorithm for (a, b) = (30, 36) and then for (a,b) = (64, 49). (b) What does Algorithml compute? (c) Find an estimate for the order of complexity of algorithml in terms of n = max(a, b). Question 3. Consider the following algorithm procedure Algorithm1(a;b: positive integers) while a 0 do begin if ab then a = a - b else interchange a and b end output b (a) Step by step, execute the algorithm for (a, b) = (30, 36) and then for (a,b) = (64, 49). (b) What does Algorithml compute? (c) Find an estimate for the order of complexity of algorithml in terms of n = max(a, b).