Comparison Sorting Algorithm Complexity

问题:

Why is the lower bound for the time complexity of comparison-based sort algorithms O(n log n)?

回答1:

http://en.wikipedia.org/wiki/Comparison_sort#Number_of_comparisons_required_to_sort_a_list

answers that question quite well, I think.

回答2:

In short, because you must look at every element which is O(n). For each of those elements you look at, you must find out if its in the right order, which is at best O(log n) (binary search for example). So the net sum becomes O(n log n)