public void InsertionSort(CompareFunc comparer) { for (int i = 1; i < size; i++) { T curr = array[i]; int j = i; while (j > 0 && comparer(array[j - 1], curr) > 0) { array[j] = array[j-1]; j--; } array[j] = curr; } }