What is the {best|average|worst}-case time for Selection Sort to sort an array of n records?
\Theta(n^2)\Theta(n)\Theta(\log n)\Theta(n \log n)Does Selection Sort's order and number of comparisons depend on the particular order of the input array?
No, it does not.
Recall that our implementation for Selection Sort will try to swap even if the current record is in its correct location.