The program insertsort contains 2 nested loops. The inner is dependant on the outer.

The number of iterations of the loops in the program is input dependent (global variable a). 

When the program is run for all orderings of input data (array position 1 - 10 are 1 or 2, 2^10 combinations) the result is:

No. of iterations for main_L1 = 9
Maximum no. of iterations per invocation for main_L1_L1 is 9, maximum sum of iterations is 63