2) [15 points] Give the worst case Big-O runtime of code snippets given in part (a)...

Transcribed Image Text:

2) [15 points] Give the worst case Big-O runtime of code snippets given in part (a) -(e)? Explain your working. a) def exercisel (N): for i in range (0, N): for i in range (N, 1, -1): a = a + i + j for jin range (0, N/2): b = b + i + j b) def exercise2 (N): count O i N while ( 0 ): for i in range (0,1): count count + 1 i = 1//2 c) def exercise3 (arr): N len (arr) for i in range (0,N): for i in range (0,N): binarySearch (arr, j) selectionSort (arr) d) def exercise4 (L): N = len(L) 5 9 = [] for i in range (N**2): s.append(L[i % N]) return mergeSort (3) e) def exercise5 (arr, N): counter = 1 while counter 2) [15 points] Give the worst case Big-O runtime of code snippets given in part (a) -(e)? Explain your working. a) def exercisel (N): for i in range (0, N): for i in range (N, 1, -1): a = a + i + j for jin range (0, N/2): b = b + i + j b) def exercise2 (N): count O i N while ( 0 ): for i in range (0,1): count count + 1 i = 1//2 c) def exercise3 (arr): N len (arr) for i in range (0,N): for i in range (0,N): binarySearch (arr, j) selectionSort (arr) d) def exercise4 (L): N = len(L) 5 9 = [] for i in range (N**2): s.append(L[i % N]) return mergeSort (3) e) def exercise5 (arr, N): counter = 1 while counter