What is the best-case time complexity of Insertion Sort?

Question

Accepted Answer

(C) O(n). Explanation: When the input is already sorted, Insertion Sort only does n-1 comparisons → O(n).