undefined | Better HN

0 pointssclangdon9y ago0 comments

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.

0 comments

imaginenore9y ago

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?

sanxiyn9y ago

They probably should. After all Boost is often a staging area for C++ standard library.

j / k navigate · click thread line to collapse

0 pointssclangdon9y ago0 comments

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.

0 comments

imaginenore9y ago

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?

sanxiyn9y ago

They probably should. After all Boost is often a staging area for C++ standard library.

j / k navigate · click thread line to collapse