What is the Big-O running time of the folloning function? def bubblesort (arr): n len (arr) + Traverse through all array elements for i in range (n): Last i elements are already in place for j in...

Extracted text: What is the Big-O running time of the folloning function? def bubblesort (arr): n len (arr) + Traverse through all array elements for i in range (n): Last i elements are already in place for j in range (0, n-i-1): if arr[j] > arr[j+1] : arrijl, arrij+1] - arrij+11, arrijl nlist - [14, 46, 43, 27, 57, 41, 45,21, 70] bubblesort (nlist) print (nlist) O en? ejlog n) O(1) en) In algorithm analysis, how many operations are performed by the following line of code: for i in range(0, n): On-1 On+1 On On-2 O O O O


Extracted text: Analyze the following code fragment and answer the questions: test - 0 for i in range(n): test = test + 1 for j in range(n): test - test - 1 a Wite lotal number of operations as a function se b. What is the total number of operations if n= 100 (show all work) c. What is its Big-O running time? In algorithm analysis, how many operations are pertormed by the 2nd line of code? for i in range(len(Wst1)): for j in range(len(Nist2): On2 On+n O-2 n² -1