Radix Sort
Jump to navigation
Jump to search
Internal
Overview
If there are n integers to sort, each integer has d digits, and each digit can take up to k possible values, then radix sort can sort the numbers in Θ(d(n + k)) time.
| Worst-case time | Θ(d(n + k)) |
| Average-case time | Θ(d(n + k)) |
| Best-case time |