In the worst case, each record must make its way to the start of the array. This would occur if the record values are initially arranged from highest to lowest, in the reverse of sorted order.

In this case, the number of comparisons will be one the first time through the for loop, two the second time, and so on.