1 votes 1 votes 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 ____________ Algorithms applied-course-2019-mock1 numerical-answers algorithms radix-sort + – Applied Course asked Jan 16, 2019 recategorized Jul 4, 2022 by Lakshman Bhaiya Applied Course 502 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 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. Applied Course answered Jan 16, 2019 Applied Course comment Share Follow See all 0 reply Please log in or register to add a comment.