To sort $$N$$ records by merge sort, the best-case time complexi

To sort $$N$$ records by merge sort, the best-case time complexity and worst-case time complexity are both $$O(NlogN)$$. ~@[](1)

答案：TRUE