Reference no: EM132637560

Sorting in this question I will examine the final order. Post-order Sorts the elements in the array A containing n integers as follows: First find the largest element in the array, and this element placed at the end of the array. Then the largest element among the remaining elements is found and placed in the second last row of the array. The same applies to every element in the array. Pseudo code of the algorithm is given below.

Penultimate_Ranking(A)

n= A*length
for j = n to 2
biggest = j
for i = j - 1 to 1
if A[i] > A[biggest]
biggest = I
Replace A [j] with A [biggest].

a) How many comparisons does a post-order run for an array of n elements?

b) Worst, best and average running time of the end-order algorithm when sorting an array with n elements, what? Indicate using asymptotic notation. Explain.