Timsort
hybrid sorting algorithm based on insertion sort and merge sort
Facts
12 properties- Instance of
- sorting algorithm, stable sorting algorithm, comparison sort, hybrid algorithm, adaptive sort[2][3][4][5]
- Publication date
- 2002[10]
- Based on
- merge sort, insertion sort[7][8]
- Average time complexity
- O(n \log(n))
- Best-case time complexity
- O(n)
- Discoverer or inventor
- Tim Peters[1]
- Named after
- Tim Peters[6]
- Time of discovery or invention
- 2002[9]
- Worst-case space complexity
- O(n)
- Worst-case time complexity
- O(n \log(n))
🏷️ Also known as
en Timsort
fa مرتبسازی تیم
ja ティムソート
ko 팀소트
🔖 Identifiers · 2
- Freebase ID
- /m/076wtj2
- Microsoft Academic ID (discontinued)
- 64842302
🔗 Connections
Instance of 4
Used by 3
Based on 2
← Derivative work 2
Created notable works 1
Discoverer or inventor 1
Named after 1
Uses 1
Press Enter · cited answer in seconds