I am examining the following code:

My question is why the values are (n-1) (for example line 2) instead of n throughout the code.

Insertion Sort Statement InsertionSort (A, n) f for i 2 to n { key = A[i] c2(n-1) c3(n-1) while (j 0) and (A[j1 > key)C4T cs(T-(n-1)) c(T-(n-1)) A[j+1] key c(n-1) T = t-+4 + t, where t, is number of while expression evaluations for the is for loop iteration 2.51