Analyze the time complexity of the algorithm below. Use the Big- notation: T(n)= O(?). Provide justification...

 

Transcribed Image Text:

Analyze the time complexity of the algorithm below. Use the Big- notation: T(n)= O(?). Provide justification for your result. DoSomething (A, n) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 for (i=n;i>=1; i--) maxIndx=i maxValue=A[i] for (j=1;j A [maxIndx]) maxIndx=j maxValue=A[j] A [maxIndx] =A[i] A[i]=maxValue cnt3rd=0 for (i=1;i Analyze the time complexity of the algorithm below. Use the Big- notation: T(n)= O(?). Provide justification for your result. DoSomething (A, n) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 for (i=n;i>=1; i--) maxIndx=i maxValue=A[i] for (j=1;j A [maxIndx]) maxIndx=j maxValue=A[j] A [maxIndx] =A[i] A[i]=maxValue cnt3rd=0 for (i=1;i