Illustrates the Radix Sort

Question

Illustrates the Radix Sort?

Answer 1

The radix sort takes a catalogue of integers and puts each element upon a smaller list, depending upon the value of its least significant byte. After that the small lists are concatenated, and the process is repeated for all more significant byte till the list is sorted. The radix sort is easiest to implement on fixed-length data like ints.