Sorting algorithms/Cocktail sort: Difference between revisions
Added Rust solution
PatGarrett (talk | contribs) m (→{{header|360 Assembly}}: a correction) |
(Added Rust solution) |
||
Line 3,018:
next i
end</lang>
=={{header|Rust}}==
<lang rust>fn cocktail_sort<T: Ord>(a: &mut [T]) {
let len = a.len();
loop {
let mut swapped = false;
let mut i = 0;
while i + 2 <= len {
if a[i] > a[i + 1] {
a.swap(i, i + 1);
swapped = true;
}
i += 1;
}
if swapped {
swapped = false;
i = len;
while i >= 2 {
if a[i - 2] > a[i - 1] {
a.swap(i - 2, i - 1);
swapped = true;
}
i -= 1;
}
}
if !swapped {
break;
}
}
}
fn main() {
let mut v = vec![10, 8, 4, 3, 1, 9, 0, 2, 7, 5, 6];
println!("before: {:?}", v);
cocktail_sort(&mut v);
println!("after: {:?}", v);
}</lang>
{{out}}
<pre>
before: [10, 8, 4, 3, 1, 9, 0, 2, 7, 5, 6]
after: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
</pre>
=={{header|Scala}}==
| |||