Contents

EnglishEdit

 
Wikipedia has an article on:
Wikipedia

NounEdit

introspective sort ‎(plural introspective sorts)

  1. (computing) 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.

SynonymsEdit

TranslationsEdit