News for hackers. Stuff that matters.

A comment on Neural programmer better than Quicksort. Parent comment

Re:Neural programmer better than Quicksort by mkl on Friday July 10, 2020 @06:34AM (#23790018)
Possibly better would be Timsort (used in Python, Java, V8, etc.), as it's "designed to take advantage of runs of consecutive ordered elements that already exist": https://en.wikipedia.org/wiki/Timsort
[ Parent | on HN ]
Re:Neural programmer better than Quicksort by eru on Friday July 10, 2020 @09:41AM (#23791365)
Haskell's standard library sort, a variant of merge sort, also makes use of runs.

It runs in O(n log (number of runs)). It's quite a lot simpler than Timsort.

[ Parent | on HN ]