Sorting Algorithms Questions
The best-case time complexity of selection sort is O(n^2), where n represents the number of elements in the array.