为什么下界的比较为基础的排序算法澳时间复杂度（N日志N）？
Why is the lower bound for the time complexity of comparison-based sort algorithms O(n log n)?
推荐答案en.wikipedia/wiki/Comparison%5Fsort#Number%5Fof%5Fcomparisons%5Frequired%5Fto%5Fsort%5Fa%5Flist
回答了这个问题非常好，我想。
answers that question quite well, I think.