Number of comparisons in insertion sort

Question

In this program, I want to calculate the number of data comparisons in the insertion sort, but my code is not working as I expected.

def insertionSort(list):
            


        

Answer 1

Don't forget that loop header executed +1 more then the loop body, which we call the exit-condition, take this example:

S = 0;
for(int i = 0; i < 5; i++) {
    S++;
}

The S++ runs 5 times, however the i < 5 runs 6 times, the last one is to check if i < 5, will find the false and exit the loop.