public <T extends Comparable<T>> int insertionSort(T[] array) {
	  currentCompares = 0;
    int N = array.length;
    for (int i = 1; i < N; i++) {
    	for (int j = i; j > 0 && less(array[j], array[j-1]); j--) {
    		exch(array, j, j-1);
    	}
    }
    return currentCompares;
  }