News for hackers. Stuff that matters.
Re:Blitsort: An ultra-fast in-place stable hybrid merge/quic... by devit on Friday December 02, 2022 @06:57AM (#33829361)
This is only for algorithms whose output is solely dependent on the outcomes of comparisons of input values.

Otherwise you can for instance sort an input made of zeroes and ones in O(n) time and O(log(n)) space by counting the ones.

There are no comments on this comment yet.