News for hackers. Stuff that matters.

A comment on On the Worst-Case Complexity of TimSort. Parent comment

Re:On the Worst-Case Complexity of TimSort by ehsankia on Friday August 31, 2018 @04:00AM (#17883769)
It sort of is though. You can have a really large N with rho = 1, just like you can have a really small N with rho=N. They're orthogonal variables, and they both impact the run time.
[ Parent | on HN ]

There are no comments on this comment yet.