Question

ALGORITHM | Sort INPUT: data[] - array size n with max element M, i.e. for 0 ? i < n, data[i] ? M. OUTPUT: sorted_data[] - sorted array 1. Initialize an array of M + 1 zeros e.g. ele_count = new int [M+1] 2. For every element j in data[], update the array of counts at data[j] by 1. e.g. ele_count[data[j]] += 1 3. Create a second array of size M + 1 with first element being the same as the first created array, and the j-th element being the sum of the j-th in the first array and (j - 1)-st element in the second array. e.g. positions[0] = ele_count[0] positions[j] = ele_count[j] + positions[j-1] 4. Initialize an array size n for sorted elements. e.g. sorted_array = new int[n] 5. For i = 0, 1, ..., n - 1, place data[i] into the position returned by one less than value of the second array evaluated at data[i]. Then decrement the value accessed in the second array by 1. e.g. sorted_array[positions[data[i]] - 1] = data[i] positions[data[i]] -= 1

          ALGORITHM | Sort
INPUT: data[] - array size n with max element M, i.e. for 0 ? i < n, data[i] ? M.
OUTPUT: sorted_data[] - sorted array
1. Initialize an array of M + 1 zeros
e.g. ele_count = new int [M+1]
2. For every element j in data[], update the array of counts at data[j] by 1.
e.g. ele_count[data[j]] += 1
3. Create a second array of size M + 1 with first element being the same as the first created array, and the j-th
element being the sum of the j-th in the first array and (j - 1)-st element in the second array.
e.g. positions[0] = ele_count[0]
positions[j] = ele_count[j] + positions[j-1]
4. Initialize an array size n for sorted elements.
e.g. sorted_array = new int[n]
5. For i = 0, 1, ..., n - 1, place data[i] into the position returned by one less than value of the second array evaluated at data[i]. Then decrement the value accessed in the second array by 1.
e.g. sorted_array[positions[data[i]] - 1] = data[i]
positions[data[i]] -= 1

ALGORITHM | Sort
INPUT: data[] - array size n with max element M, i.e. for 0 ? i < n, data[i] ? M.
OUTPUT: sorteddata[] - sorted array
1. Initialize an array of M + 1 zeros
e.g. elecount = new int [M+1]
2. For every element j in data[], update the array of counts at data[j] by 1.
e.g. elecount[data[j]] += 1
3. Create a second array of size M + 1 with first element being the same as the first created array, and the j-th
element being the sum of the j-th in the first array and (j - 1)-st element in the second array.
e.g. positions[0] = elecount[0]
positions[j] = elecount[j] + positions[j-1]
4. Initialize an array size n for sorted elements.
e.g. sortedarray = new int[n]
5. For i = 0, 1, ..., n - 1, place data[i] into the position returned by one less than value of the second array evaluated at data[i]. Then decrement the value accessed in the second array by 1.
e.g. sortedarray[positions[data[i]] - 1] = data[i]
positions[data[i]] -= 1

Added by Dawn R.

Question

Please give Ace some feedback