3. Work out the number of elementary operations in the worst, best and average cases for...

Transcribed Image Text:

3. Work out the number of elementary operations in the worst, best and average cases for the following algorithm (justify your answer): 0: function Nonsense (string s = s[1..n] of length n) 1: If n < 3 then 2: return s 3: If n%3=0 then 4: i +3 5: while i ≤n do 6: s[i] + a 7: i+i+3 8: 9: 10: 11: else for j1 to n do s[j] +0 return s 3. Work out the number of elementary operations in the worst, best and average cases for the following algorithm (justify your answer): 0: function Nonsense (string s = s[1..n] of length n) 1: If n < 3 then 2: return s 3: If n%3=0 then 4: i +3 5: while i ≤n do 6: s[i] + a 7: i+i+3 8: 9: 10: 11: else for j1 to n do s[j] +0 return s