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 iCannotEven on Friday August 31, 2018 @11:08AM (#17886171)
That's because the array to be sorted is packed and inflated, so as to be the worst possible input for that kind of sort.

Worst-case complexity.

Also, I needed to bump my JVM heap up to 16GB (not 9GB as recommended), just to run it.

[ Parent | on HN ]

There are no comments on this comment yet.