Why the lower bound for comparison sort is O(nlogn) ?

When I studied comparison sorts (like merge sort, quick sort) I always have a question in mind how further can we optimize the algorithm to decrease the time complexity? The answer to this question is that the lower bound of any comparison sort cann...