News for hackers. Stuff that matters.
Re:On the Worst-Case Complexity of TimSort by notriddle on Friday August 31, 2018 @03:38PM (#17888175)
You probably want to use pdqsort, since it detects and switches to heapsort for any killer inputs. https://drive.google.com/file/d/0B1-vl-dPgKm_T0Fxeno1a0lGT0E...
Re:On the Worst-Case Complexity of TimSort by lorenzhs on Friday August 31, 2018 @05:13PM (#17888644)
Thanks, I totally forgot about pdqsort! If I recall correctly, it's partially based on blockquicksort, but includes a lot of other improvements. It's a very interesting algorithm, much faster than introsort etc. However, I believe that IPS4o is still faster overall (I think I asked Sascha, one of the authors of IPS4o, about this a while ago, but I don't have any measurements at hand), even before accounting for IPS4o's parallel implementation. You should definitely check out both :)