No comparison-based sorting algorithm has the Worst Case time complexity better than O(nlogn)