Question

Need to find number of elementary expressions in terms of n, not looking for Big O complexity.

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: it1 2: k + 2 while i<n do for j+ 1 to n do if j%5 = 0 then menin else while k <n do constant number C of elementary operations k+ k k end while end for it 51 14: end while 15: return m

Answer 1

for The objective is to find number of elementary expressions in terms of no To Wölk out the number of elementary operations Worst possible case and the best possible case for the following algorithms. from the given algorithm. 0: function Nonsense ( positive integer ] 3: 4: 5: kar While ico do for ja to n if j7.5 -0 Then do f elementary operations #: else 8: while ASD do constant Rember 'c' 10: Kakok end while 12: and for 13: is si 14% end while 15; return m.

n- iteration line 3 Line u Lowes iteration line 8 ....... D-1 iteration in wast case if ( possible] No Element js meeltiple of '5' executed are are all The 3,4,8 3.4. & line no Three T Th = olaos 7 In Best Case (possible] All element are multiple only three live 3, u are of 's'. executed Ton) och ) - * -