Applied Course | Mock GATE | Test 1 | Question: 55

Question

Suppose a radix sort was done on the following set of numbers, in binary i.e,$[11, 10, 3, 14, 12, 2, 8, 15, 2]$. How many passes of counting sort would be performed ____________

Answer 1

The highest number in this set is $15$, which is $1111$ in binary. Since there are four binary digits, the radix sorting algorithm will make $4$ passes of the counting sort procedure.