Re:On the Worst-Case Complexity of TimSort
by pxndx on Friday August 31, 2018 @04:28AM
(#17883883)
Runs can be increasing or decreasing, a reversed array is a single run. Worst case is n/2 because you can always split the array in pairs (if it alternates a high and a low value for example).
[ Parent
| on HN ]