Sorting algorithms/Merge sort: Difference between revisions
→{{header|Rust}}
Line 6,286:
for i in 0..src.len() {
dst[i] = src[i];
}
}
#[inline(always)]
fn insertion_sort<T: Ord>(v: &mut [T]) {
for i in 1..v.len() {
let mut j = i;
while j > 0 && v[j] < v[j - 1] {
v.swap(j, j - 1);
j -= 1;
}
}
}
| |||