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...