linsort - 18
Lin / Devi
Each pass over n d-digit numbers then takes time (n+k). (Assuming counting sort is used for each pass.)
There are d passes, so the total time for radix sort is (d (n+k)).
When d is a constant and k = O(n), radix sort runs in linear time.
Radix sort, if uses counting sort as the intermediate stable sort, does not sort in place.
If primary memory storage is an issue, quicksort or other sorting methods may be preferable.