Consider the following algorithm: void sort(int A[], int n) { 1 int i = 0, j,...

Transcribed Image Text:

Consider the following algorithm: void sort(int A[], int n) { 1 int i = 0, j, s; 2 while(i <n-1){ 3 s = i; 4 j=i+1; 5 while(j <n){ 6 if(A[j] <A[s]) 7 s =j; j+= 1; 78 8 9 10 } } } A[i] = A[s]; i += 1; a.) Give a precise line count for every numbered line of code in terms of n. Use indicator functions if/when needed. b.) What is the efficiency of the algorithm in terms of Big-O? Consider the following algorithm: void sort(int A[], int n) { 1 int i = 0, j, s; 2 while(i <n-1){ 3 s = i; 4 j=i+1; 5 while(j <n){ 6 if(A[j] <A[s]) 7 s =j; j+= 1; 78 8 9 10 } } } A[i] = A[s]; i += 1; a.) Give a precise line count for every numbered line of code in terms of n. Use indicator functions if/when needed. b.) What is the efficiency of the algorithm in terms of Big-O?

Answer rating: 100% (QA)

Analyzing the Sorting Algorithm a Line count for each numbered line Line 1 Executed 1 time independe... View the full answer