public void sort(int[] array) { #header
  if (array == null) #ifNull
    return; #returnNull
  int i, j;  #variables
  i = array.length - 1; #initializeI
  boolean isSorted = false; #initSwap
  while (i >= 0 && !isSorted) { #outerLoop
    isSorted = true; #resetSwap
    for (j = 0; j <= i - 1; j++) { #innerLoop
      if (array[j1] > array[j + 1]) {  #if
        swap(array, j, j + 1); #swap
        isSorted = false; #swap=false
      } #endif
    } #endInnerLoop
    i = i - 1; #decrementI
  } #endOuterLoop
} #end