Introsort
← Back to Hybrid
A hybrid sorting algorithm that begins with quicksort, switches to heapsort when recursion depth exceeds a threshold, and uses insertion sort for small subarrays. The default sorting algorithm in C++. O(n log n) worst case, in-place, not stable.