Sorting algorithms/Merge sort: Difference between revisions

Line 6,328:
#[inline(always)]
fn merge<T: Copy + Ord>(a: &[T], b: &mut [T]) {
let (mut i, mut j, mut k) = (0, a.len(), 0);
loopfor k in 0..b.len() {
if a[i] <= b[j] {
b[k] = a[i];
Line 6,344:
}
}
k += 1;
}
}
21

edits