What is the best case and worst-case complexity of selection sort?

Explanation

Selection sort always scans the remaining array to find the minimum, so both the best and the worst case are O(n²).