What is the running time of Selection Sort when the input is an array that {has already been sorted|is reverse sorted|has all equal values}?

\Theta(n^2)
  • \Theta(n)
  • \Theta(\log n)
  • \Theta(n \log n)

Each test in the inner for loop will be the same no matter what the order of the input array.