87
    88            1 void insertionSort(int sequence[], int numElements) {
    89            2     int i, j;
    90            3
    91            4     for (i = 1; i < numElements; i++) {                                     executed numElements Times
    92            5         for (j = i; j > 0; j--) {                                                           2, 3, 4, 5,.... numElements times
    93            6             if (sequence[j] < sequence[j - 1]) {                    1,2,3,4,5,6.....numelements-1
    94            7                 swap(&sequence[j], &sequence[j - 1]);   --not really too interested, dependant on list
    95            8             }
    96            9         }
    97           10     }
    98           11 }
    99
   100
   101
   102
   103            1 void bubbleSort(int sequence[], int numElements) {
   104            2     int i, j;
   105            3
   106            4     for(i = numElements - 1; i >= 0; i--) {                                 numElements+1 times
   107            5         for(j = 1; j <= i; j++) {                                                           numelelements....1,2
   108            6             if (sequence[j - 1] > sequence[j]) {                    numelements-1, numelements-2.......2, 1
   109            7                 swap(&sequence[j], &sequence[j - 1]);
   110            8             }
   111            9         }
   112           10     }
   113           11 }