(Choose 1 answer)
Select the most correct statement:
A. In all cases the insertion sort is O(n^2).
B. The complexity of insertion sort is O(n^2), in the best case it is O(n).
C. The complexity of insertion sort is O(nlog n), in the best case it is O(n).
D. The complexity of insertion sort is O(n^2), in the best case it is O(nlog n).
FUO
