The best-case time complexity of insertion sort is

Explanation

If the array is already sorted, each element is compared once with its predecessor and no shifting is needed, so the best case is O(n).