The best "worst-case time complexity" for any algorithm that sor

The best "worst-case time complexity" for any algorithm that sorts by comparisons only must be $$O(NlogN)$$. ~@[](1)

答案：TRUE