인트로 정렬
Sign in to saveAlso known as introspective sort
Introsort or introspective sort is a hybrid sorting algorithm that provides both fast average performance and (asymptotically) optimal worst-case performance. It begins with quicksort, it switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted and it switches to insertion sort when the number of elements is below some threshold. This combines the good parts of the three algorithms, with practical performance comparable to quicksort on typical data sets and worst-case O(n log n) runtime due to the heap sort. Since the three a
Key facts
- Algorithm.class
- Sorting algorithm
- Algorithm.data
- Array
- Algorithm.time
- O(n log n)
- Algorithm.average time
- O(n log n)
- Algorithm.optimal
- yes
via Wikipedia infobox
Wikidata facts
Show 2 more facts
- Stack Exchange tag
- stackoverflow.com/tags/introsort
- time of discovery or invention
- 1997-00-00
Sources (1)
via Wikidata · CC0
Connections
sorting algorithm
Entity
big O notation
Entity
International Standard Book Number
Entity
Java
Entity
logarithm
Entity
digital object identifier
Entity
Q5289
Entity
Go
Entity
Q118398
Entity
Niklaus Wirth
Entity
Q575650
Entity
quicksort
Entity
bubble sort
Entity
array data structure
Entity
GNU Compiler Collection
Entity
merge sort
Entity
selection sort
Entity
insertion sort
Entity
Standard Template Library
Entity
computational complexity theory
Entity