4 ms·
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
by kamyarg 7y ago
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-and-mystery-of-nlogn-complexity-d7e80c34876 https://medium.com/@kamyarg/comparison-sorting-algorithms-an...
- bonoboTP 7y agoIt'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.