Re:On the Worst-Case Complexity of TimSort
by pelario on Friday August 31, 2018 @03:51AM
(#17883728)
Exactly. Sometimes those are called "adaptive algorithms", in the sense that the complexity depends on some properties of the input, so even though the worst case complexity is still O(n log n), for many outputs it will do much better.
[ Parent
| on HN ]
There are no comments on this comment yet.