Alexander S. Kulikov
Results
1
comments of
Alexander S. Kulikov
I agree that it is worth noting that the $\Omega(n \log n)$ lower bound applies to comparison-based algorithms only: say, one can easily sort $n$ bits in time $O(n)$.