introspective sort

From Wiktionary, the free dictionary
Archived revision by TheDaveBot (talk | contribs) as of 17:17, 24 May 2017.
Jump to navigation Jump to search

English

English Wikipedia has an article on:
Wikipedia

Noun

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

Translations