Sorting Algorithms/Timsort

From Rosetta Code
< Sorting Algorithms(Redirected from Timsort)

Timsort is a stable sorting algorithm. It is a hybrid between Insertion sort and Merge sort so, it brings in the best of two worlds.

Time Complexity: O(nlogn) Space Complexity: O(n)

C: [CPython's Timsort]

Java: [OpenJDK's Timsort]

C++: [GNU Octave's Timsort]