1. Give the order of growth (as a function of N) of the running times of...

  

Transcribed Image Text:

1. Give the order of growth (as a function of N) of the running times of each of the following code fragments: # Block (a) sum = 0; n = N while n > 0: for i in range(0, n): sum += 1; n = n // 2 # Block (b) sum = 0 i = 1 while i < N: for j in range(0, 1): sum += 1 i = i * 2 # Block (c) sum = 0 i = 1 while i 1. Give the order of growth (as a function of N) of the running times of each of the following code fragments: # Block (a) sum = 0; n = N while n > 0: for i in range(0, n): sum += 1; n = n // 2 # Block (b) sum = 0 i = 1 while i < N: for j in range(0, 1): sum += 1 i = i * 2 # Block (c) sum = 0 i = 1 while i