Lines Matching refs:increment
25 * Note that the running time can be tuned by adjusting the size of the increment used
27 * of increment = increment / 3 + 1.
31 int increment = count / 3 + 1;
34 while ( increment > 1 ) {
35 for ( int start = 0; start < increment; start++ ) {
36 insertionSort(array, count, start, increment, comparator);
38 increment = increment / 3 + 1;
41 // Do a final pass with an increment of 1.
43 // next increment will keep generating 1 repeatedly.)
50 * fixed increment apart.
56 * @param increment the increment
58 public void insertionSort(Type[] array, int count, int start, int increment,
64 for (int i = start + increment; i < count; i += increment) {
66 k = j - increment;
71 // increment until the proper place is found.
76 k = j - increment;
