Opening the reading…
Opening the reading…
SORTING › COUNTING SORT
This is a scratch drill — your code runs, nothing is graded or recorded. No test cases, no expected output, no verdict.
TASK
Implement counting sort for the array [4, 2, 2, 8, 3, 3, 0]. Build frequencies for slots 0-8, then reconstruct the array by writing each value as many times as its frequency, and print the result in bracketed form.
OUTPUT
Sample[0, 2, 2, 3, 3, 4, 8]
What a finished answer prints, from the lesson. Nothing has run yet — press Run and this is replaced by your program’s own output.