//@LoopBound(max=SIZE - 1)
    	for (int i = 2; i <= SIZE; i++)
    	{
<<<<<<< HEAD
            // The guard will be false when j=1, because a[0] = 0 < a[i>1]
            // Worst case loop bound :  n - 1
            // Worst-case total bound : ((n-1) * n) / 2
            for (int j = i; a[j] < a[j - 1]; j--) // @WCA loop=9
=======
    		// Worst-case 'absolute' loop bound: (n^2 - n) / 2 
    		for (int j = i; a[j] < a[j - 1]; j--) // @WCA loop=9
>>>>>>> 67dfffd7c26c4c56e264a86764ac5510d6f69607
    		{
    			int temp = a[j];
    			a[j] = a[j - 1];

        //@LoopBound(max=SIZE - 1)
    	for (int i = 2; i <= SIZE; i++)
    	{
            // The guard will be false when j=1, because a[0] = 0 < a[i>1]
            // Worst case loop bound :  n - 1
            // Worst-case total bound : ((n-1) * n) / 2
            for (int j = i; a[j] < a[j - 1]; j--) // @WCA loop=9
    		for (int j = i; a[j] < a[j - 1]; j--) // @WCA loop=9
    		{
    			int temp = a[j];
    			a[j] = a[j - 1];