Re:On the Worst-Case Complexity of TimSort
by lmm on Friday August 31, 2018 @12:52PM
(#17887046)
TimSort is an immensely complex sorting algorithm, full of magic numbers and difficult to analyse formally (e.g. the invariants it preserves are multi-line disjunctions). I'm not surprised there are still bugs to be found in it. I do think that issues like this make the case for using simpler, clearer algorithms even at a slight performance penalty.
[ Parent
| on HN ]
There are no comments on this comment yet.