In an coding exam, I was once asked this question:
Assuming that you are only sorting Integers in ascending order, which algorithm do you use when you want to prioritize speed the most, but you also want to save space?
The options were:
- LSD Radix Sort
- Merge Sort
- Quick Sort
I think an argument can be made between LSD Radix Sort and Quicksort.
Radix sort would function in $O(k n)$ and Quicksort would function in $O(n \log n)$ and worst case, $O(n^2)$
I chose Radix Sort as the answer, but I'm curious as to what others had to say.