Sorting Algorithms/Timsort

From Rosetta Code
< Sorting Algorithms
Revision as of 05:09, 26 June 2016 by rosettacode>GreySunshine (GreySunshine moved page Timsort to Sorting Algorithms/Timsort: For this page to showup under Sorting Algorithms)

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=268699"