Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
→{{header|Rust}}: Updated to the Rust 1.3.0
(→{{header|Rust}}: Updated to the Rust 1.3.0) |
|||
Line 2,169:
=={{header|Rust}}==
<lang rust>fn insertion_sort<T: std::cmp::Ord>(arr: &mut [T]) {
for i in
let mut j = i;
while j > 0 && arr[j] < arr[j-1] {
arr.swap(j, j-1);
j = j-1;
}
}
}</lang>
| |||