introspective sort

/IH0 N T R AH0 S P EH1 K T IH0 V S AO0 R T/
noun
  1. 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.

Translate “introspective sort” into another language

Choose a language below to open the translator with English selected as the source language.

🇪🇸Spanish🇫🇷French🇩🇪German🇸🇦Arabic🇨🇳Chinese Simplified🇯🇵Japanese🇮🇳Hindi🇧🇷Portuguese🇷🇺Russian🇰🇷Korean🇮🇹Italian🇹🇷Turkish
See all 248+ languages
Back to Dictionary