Jump to content

Sorting algorithms/Comb sort: Difference between revisions

Line 102:
=={{header|Java}}==
This is copied from [[wp:Comb sort|the Wikipedia article]].
<lang java>public static <E extends Comparable<? super E>> void sort(ComparableE[] input) {
int gap = input.length;
boolean swapped = true;
Line 109:
gap = (int) (gap / 1.3);
}
int i = 0;
swapped = false;
whilefor (int i = 0; i + gap < input.length; i++) {
if (input[i].compareTo(input[i + gap]) > 0) {
ComparableE t = input[i];
input[i] = input[i + gap];
input[i + gap] = t;
swapped = true;
}
i++;
}
}
}</lang>
 
 
=={{header|Lua}}==
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.