News for hackers. Stuff that matters.
Re:Sorting a Billion Numbers with Julia by imh on Tuesday March 22, 2016 @02:51AM (#11334811)
It should stay n log n. A lazy quicksort can get the min element of a list super fast by only working on the partitions relevant to finding the min. As it requires more elements of the list, it can finish sorting the other partitions. It's the exact same algo as usual.

There are no comments on this comment yet.