" It begins with quicksort, it switches to heapsort when the recursion depth exc...

zhangxp1998 on Feb 14, 2020 | parent | context | favorite | on: Quadsort: a stable non-recursive merge sort

" It begins with quicksort, it switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted and it switches to insertionsort when the number of elements is below some threshold. "