9. What is the time complexity of the following algorithm? Assume that the number of elements...

  

Transcribed Image Text:

9. What is the time complexity of the following algorithm? Assume that the number of elements in array A is equal to N. A: array of numbers low: lowest index of array (0) mid: index of array A, low <mid < high high: highest index of array A (Number of elements -1) function F(A, Low,mid, high) for 8< i <=mid 1 2 3 NESETERGEESTLASE 10 11 12 13 14 15 16 17 18 19 20 21 22 B[i]=A[1] for 8 i< (high-mid) O Theta(N) C[i]=A[i+mid+1] i=0; j=0; k=0 while( i cemid AND j<(high-mid)) if(B[i]<C[j]) A[k] =B[1] i=i+1 Theta(2*N) else k=k+1 if(i>mid) A[k] =C[j] j=j+1 for j<n< high-mid A[k]=C[m] k=k+1 if(j= (high-mid)) end function for i<m <mid+1 A[k] B[m] k=k+1 Theta (NlogN) Onone of the others O Theta(logN) 9. What is the time complexity of the following algorithm? Assume that the number of elements in array A is equal to N. A: array of numbers low: lowest index of array (0) mid: index of array A, low <mid < high high: highest index of array A (Number of elements -1) function F(A, Low,mid, high) for 8< i <=mid 1 2 3 NESETERGEESTLASE 10 11 12 13 14 15 16 17 18 19 20 21 22 B[i]=A[1] for 8 i< (high-mid) O Theta(N) C[i]=A[i+mid+1] i=0; j=0; k=0 while( i cemid AND j<(high-mid)) if(B[i]<C[j]) A[k] =B[1] i=i+1 Theta(2*N) else k=k+1 if(i>mid) A[k] =C[j] j=j+1 for j<n< high-mid A[k]=C[m] k=k+1 if(j= (high-mid)) end function for i<m <mid+1 A[k] B[m] k=k+1 Theta (NlogN) Onone of the others O Theta(logN) 9. What is the time complexity of the following algorithm? Assume that the number of elements in array A is equal to N. A: array of numbers low: lowest index of array (0) mid: index of array A, low <mid < high high: highest index of array A (Number of elements -1) function F(A, Low,mid, high) for 8< i <=mid 1 2 3 NESETERGEESTLASE 10 11 12 13 14 15 16 17 18 19 20 21 22 B[i]=A[1] for 8 i< (high-mid) O Theta(N) C[i]=A[i+mid+1] i=0; j=0; k=0 while( i cemid AND j<(high-mid)) if(B[i]<C[j]) A[k] =B[1] i=i+1 Theta(2*N) else k=k+1 if(i>mid) A[k] =C[j] j=j+1 for j<n< high-mid A[k]=C[m] k=k+1 if(j= (high-mid)) end function for i<m <mid+1 A[k] B[m] k=k+1 Theta (NlogN) Onone of the others O Theta(logN)

Answer rating: 100% (QA)

The detailed answer for the above question is provided below So the correct answer i... View the full answer