Introspective-sort Definition

noun

(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.

Wiktionary

Other Word Forms of Introspective-sort

Noun

Singular:
introspective-sort
Plural:
introspective sorts

Find Similar Words

Find similar words to introspective-sort using the buttons below.

Words Starting With

Words Ending With

Unscrambles

introspective-sort

Word Length