In any cases,algorithms with time complexity $$O(N^2)$$ spend mo

In any cases,algorithms with time complexity $$O(N^2)$$ spend more time than $$O(N*logN)$$. ~@[](1)

答案：FALSE