5. Algorithm analysis (Ex.5.6-1) a. If we measure the size of an instance of the problem of computing the great- est com

[correctanswer]

5 Algorithm Analysis Ex 5 6 1 A If We Measure The Size Of An Instance Of The Problem Of Computing The Great Est Com 1 (22.94 KiB) Viewed 108 times

5 Algorithm Analysis Ex 5 6 1 A If We Measure The Size Of An Instance Of The Problem Of Computing The Great Est Com 2 (22.94 KiB) Viewed 108 times

5 Algorithm Analysis Ex 5 6 1 A If We Measure The Size Of An Instance Of The Problem Of Computing The Great Est Com 3 (22.94 KiB) Viewed 108 times

5. Algorithm analysis (Ex.5.6-1) a. If we measure the size of an instance of the problem of computing the great- est common divisor of m and n by the size of the second parameter n, by how much can the size decrease after one iteration of Euclid's algorithm? b. Prove that the size of an instance will always decrease at least by a factor of 2 after two successive iterations of Euclid's algorithm.