The best-case time complexity to sort $$N$$ records by simple se

The best-case time complexity to sort $$N$$ records by simple selection sort and by bubble sort are both $$O(N)$$. ~@[](1)

答案：FALSE