The best case time complexity of sorting algorithms based only o

The best case time complexity of sorting algorithms based only on comparisons is at least $$O(NlogN)$$. ~@[](1)

答案：FALSE