Sorting algorithms/Cocktail sort: Difference between revisions
m
Minor edit
(Added Wren) |
m (Minor edit) |
||
Line 3,025:
let mut swapped = false;
let mut i = 0;
while i +
if a[i] > a[i + 1] {
a.swap(i, i + 1);
Line 3,034:
if swapped {
swapped = false;
i = len - 1;
while i >
if a[i -
a.swap(i -
swapped = true;
}
|