- **Radix Sort** is a non-comparative sorting algorithm that sorts numbers digit by digit, starting from the least significant digit to the most significant digit, using a stable sub-sorting algorithm (such as counting sort).
-
Steps:
Sort the elements based on the least significant digit.
Move to the next more significant digit and repeat the sorting.
Continue this process until all digits are processed.
Time Complexity:
Best, Average, Worst Case:O(nk), where n is the number of elements and k is the number of digits.