2. (10 points) Illustrate the operation of COUNTING-SORT on the array A = (4.0, 4, 1....

 

Transcribed Image Text:

2. (10 points) Illustrate the operation of COUNTING-SORT on the array A = (4.0, 4, 1. 3, 2, 0, 2). We assume that COUNTING-SORT takes three inputs: A, B, and k, where each of the n input elements is an integer in the range of 0 to k, for some integer k. Your illustration must show (i) C, where C[] holds the number of input elements equal to i for each integer i = 0, 1..... k. (ii) the running sum of the array C, and (iii) how elements are getting populated in B with each iteration in non-decreasing order. Eventually, B holds all the elements sorted in a non-decreasing order. 2. (10 points) Illustrate the operation of COUNTING-SORT on the array A = (4.0, 4, 1. 3, 2, 0, 2). We assume that COUNTING-SORT takes three inputs: A, B, and k, where each of the n input elements is an integer in the range of 0 to k, for some integer k. Your illustration must show (i) C, where C[] holds the number of input elements equal to i for each integer i = 0, 1..... k. (ii) the running sum of the array C, and (iii) how elements are getting populated in B with each iteration in non-decreasing order. Eventually, B holds all the elements sorted in a non-decreasing order.