Re:Ask HN: What is your favorite CS paper?
by joatmon-snoo on Friday August 25, 2017 @02:58AM
(#15096699)
> There is a well-known proof from information theory [...]
Remember that this proof is talking in terms of the number of comparisons necessary to sort n items. The moment you stop comparing data, like in radix sort (or more generally, bucket sort), that all flies out the window.
Remember that this proof is talking in terms of the number of comparisons necessary to sort n items. The moment you stop comparing data, like in radix sort (or more generally, bucket sort), that all flies out the window.