What is the best-case time for Insertionsort to sort an array of n records?
\Theta(n)\Theta(n^2)\Theta(\log n)\Theta(n \log n)The best-case cost occurs when the records are already in sorted order from lowest to highest.
In this case, every test on the inner for loop will fail immediately, and no records will be moved.