Question

Algorithm ComparisonCountingSorting(A[0..n-1], S[0..n-1] )

         //Input: Array A[0..n-1] of orderable values

         //Output: Array S[0..n-1] of A's values in ascending order

  for i ← 0 to n – 1 do

Count[i] ← 0

        for i ← 0 to n – 2 do

for j ← i + 1 to n – 1 do

                     if A[i] < A[j]

   Count[j] ← Count[j] + 1      // increment counter of larger

else

Count[i] ← Count[i] + 1

  for i ← 0 to n – 1 do

S[ Count[i] ] ← A[i]

For n = 6, trace this algorithm to sort the list 30, 18, 40, 48, 8, 24 into ascending order by indicating the final values of the array Count.

Note: do not show the final sorted values; just the Count values.

Enter the correct values for each sub-scripted element of the array Count:

Count[0] =  

Count[1] =  

Count[2] =

Count[3] =  

Count[4] =  

Count[5] =

Answer 1