Radix Sort
Sorts integers digit by digit using a stable sub-sort at each place value.
Interactive Visualization
Loading visualization…
Usage
import { radixSort } from 'athro';
const arr = [170, 45, 75, 90, 802, 24, 2, 66];
radixSort(arr);
Time Complexity
| Case | Time Complexity | Description |
|---|---|---|
| Best | O(nk) | k is the number of digits |
| Average | O(nk) | One pass per digit place |
| Worst | O(nk) | Fixed number of digit passes |