(Choose 1 answer)
Select the most correct statement about the complexity of insertion sort
A. Both best and worst cases are O(n^2)
B. The best case is O(n), and the worst case is O(nlogn)
C. The best case is O(nlogn), and the worst case is O(n^2)
D. The best case is O(n), and the worst case is O(n^2)
the exam.
Exit (11
