Sorting Algorithms Questions
The best-case time complexity of smooth sort is O(n), where n is the number of elements to be sorted.