News for hackers. Stuff that matters.

A comment on Writing a Faster Sorting Algorithm. Parent comment

Re:Writing a Faster Sorting Algorithm by sclangdon on Tuesday January 03, 2017 @07:57AM (#13308774)
STL does use hybrid sorting. It is usually implemented as an introsort, which begins with a quicksort and switches to heapsort based on the number of elements to be sorted.
[ Parent | on HN ]
Re:Writing a Faster Sorting Algorithm by imaginenore on Tuesday January 03, 2017 @08:12AM (#13308837)
Sorry if that wasn't clear. I'm asking why don't they switch to the hybrid sort similar to Boost's, since it's known to be faster for most cases?
[ Parent | on HN ]
Re:Writing a Faster Sorting Algorithm by sanxiyn on Tuesday January 03, 2017 @08:21AM (#13308888)
They probably should. After all Boost is often a staging area for C++ standard library.
[ Parent | on HN ]