Wiktionary
introspective sort
n. (context computing English) A sorting algorithm that begins with quicksort and switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted.
Usage examples of "introspective sort".
A dreamy, introspective sort of child, he is a loner, develops few friendships (with fellow pupils, at any rate) and thus falls easy prey to bullying and the like.