introspective sort

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]
English Wikipedia has an article on:
Wikipedia

Noun

[edit]

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.

Synonyms

[edit]

Translations

[edit]
Translations
Retrieved from "https://en.wiktionary.org/w/index.php?title=introspective_sort&oldid=70957594"