introsort
sorting algorithm
Facts
6 properties- Instance of
- sorting algorithm, hybrid algorithm[3]
- Average time complexity
- O(n\log n)[7]
- Discoverer or inventor
- David Musser[2]
- Time of discovery or invention
- 1997[4]
- Worst-case time complexity
- O(n\log n)[6]
🏷️ Also known as
en introsort
en introspective sort
fa مرتبسازی درونگرا
ja イントロソート
ko 인트로 정렬
pl Sortowanie introspektywne
pt intro sort
tr İçgözlemle sıralama
🔖 Identifiers · 4
- Dictionary of Algorithms and Data Structures ID
- introsort, introSort, introspectionSort, introspectiveSort
- Freebase ID
- /m/01_q1s
- Microsoft Academic ID (discontinued)
- 105993963
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Discoverer or inventor 1
Instance of 1
Uses 1
Press Enter · cited answer in seconds
0 sources
Summary
introsort is a sorting algorithm[1].