4. Work out the number of elementary operations in the worst possible case and the best...

 

Transcribed Image Text:

4. Work out the number of elementary operations in the worst possible case and the best possible case for the following algorithm (justify your answer): 0: function Nonsense (positive integer n) 1: 2: 3: 4: 5: 6: 7: 8: 9: i +1 k 2 while i<n do for j← 1 to n do if j%5=0 then mn.n else while k ≤ n do constant number C of elementary operations k+ k.k end while 10: 11: 12: end for 13: i ←5i 14: end while 15: return m 4. Work out the number of elementary operations in the worst possible case and the best possible case for the following algorithm (justify your answer): 0: function Nonsense (positive integer n) 1: 2: 3: 4: 5: 6: 7: 8: 9: i +1 k 2 while i<n do for j← 1 to n do if j%5=0 then mn.n else while k ≤ n do constant number C of elementary operations k+ k.k end while 10: 11: 12: end for 13: i ←5i 14: end while 15: return m