The Radix algorithm

Posted by Dhruv Bellani

In the article below I want to talk about one of my favourite algorithms which is the radix sort algorithm

Radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix. For elements with more than one significant digit, this bucketing process is repeated for each digit, while preserving the ordering of the prior step, until all digits have been considered.

Input for Radix Sort

Radix sort only applies to integers, fixed size strings, floating points and to "less than", "greater than" or "lexicographic order" comparison predicates, whereas comparison sorts accommodates different orders.

Click here to learn more about Radix sort