What is the running time of Bubble Sort (as the algorithm is presented in this module) when the input is an array that has already been sorted?
\Theta(n^2)
\Theta(n)
\Theta(\log n)
\Theta(n \log n)
Each test in the inner for loop will fail because the
value at position i
is never less than the
value at position i-1
.