50
TimSort
Hybrid stable sorting algorithm derived from merge sort and insertion sort. Used in Python, Java, and Android. Optimized for real-world data.
Time Complexity
Best:
O(n)Average:
O(n log n)Worst:
O(n log n)Space Complexity
O(n)Properties
Stable
Color Legend
Default
Comparing
Swapping
Sorted
Pivot
Setting Value