Radix Sort is an efficient non-comparison based sorting algorithm which can sort a dataset in linear O(N) time complexity and hence, can be better than other competitive algorithm like Quick Sort. It uses another algorithm namely Counting Sort as a subroutine.
Read this article to understand Radix Sort in depth
Have a doubt or thought? Join the discussion now
This is a companion discussion topic for the original entry at http://iq.opengenus.org/radix-sort/