Re:On the Worst-Case Complexity of TimSort
by Someone on Friday August 31, 2018 @05:04AM
(#17884044)
You can make the average-case perform in O(n^2) by always pivoting on the smallest number in the array. Nobody would do _that_, but it shows that pivot choice can affect complexity.
Ergo, computer scientists researching the algorithm mathematically must consider the effect of choice of pivot.
Ergo, computer scientists researching the algorithm mathematically must consider the effect of choice of pivot.