To sort $$N$$ records by quick sort, the worst-case time complex

To sort $$N$$ records by quick sort, the worst-case time complexity is $$O(NlogN)$$. ~@[](1)

答案：FALSE