News for hackers. Stuff that matters.
Re:Neural programmer better than Quicksort by FabHK on Friday July 10, 2020 @03:01PM (#23795046)
> none of the popular sorting algorithms decide which elements to swap by looking at the whole input at each execution

Yes. In particular, the O(n log n) lower bound holds for comparison sorts, that is algorithms that rely on pairwise comparison only.

There are no comments on this comment yet.