Sorting Algorithms/Timsort

From Rosetta Code
< Sorting Algorithms
Revision as of 04:54, 26 June 2016 by rosettacode>GreySunshine (Timsort is a stable sorting algorithm, it is a hybrid between Insertion sort and Merge sort.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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)

Retrieved from "https://rosettacode.org/wiki/Sorting_Algorithms/Timsort?oldid=268698"