For sorting 10^9 unique 9-digit numbers, would radix sort or counting sort be faster, and why?
-
05-11-2019 - |
题
For sorting $10^9$ unique 9-digit numbers, would radix sort or counting sort be faster, and why?
I know that radix sort is $O(nk)$ and counting sort is $O(n+k)$, but can’t understand how to apply this.
没有正确的解决方案
不隶属于 cs.stackexchange