News for hackers. Stuff that matters.
Re:Timsort, the Python sorting algorithm by kamyarg on Tuesday October 08, 2019 @07:49PM (#21198529)
Shameless plug:

A couple years ago I wrote an article about where this O(n log n) bound comes from if anyone is interested:

"Comparison Sorting Algorithms and Mystery of NlogN complexity"

https://medium.com/@kamyarg/comparison-sorting-algorithms-an...

Re:Timsort, the Python sorting algorithm by bonoboTP on Tuesday October 08, 2019 @10:46PM (#21199506)
It's not some obscure fact. At least it was taught in my bachelor intro to algorithms class, along with the Stirling formula as part of the proof.