Day-10: Radix Sort

Radix sort is another placing based sorting algorithm that has expected linear time.

Radix sort basically takes an array and using Counting Sort as a subroutine sorts all of the digits.

At the end we get a sorted array.

Time complexity: O(d(n+b)) where d is the number of digits of the greates element. Note that complexity becomes O(n) when we onsider base ten numbers.

Here is the link of my C++ implementation of Radix Sort: Radix Sort