Function rudac::algo::sort::merge_sort

pub fn merge_sort<T: Copy + Ord>(slice: &mut [T])

Merge sort is an efficient, general-purpose, comparison-based sorting algorithm

Arguments

• slice: slice of data to be sorted

Examples

use rudac::algo::sort::merge_sort;
 
let mut vec = vec![10, 6, 1, 4, 2, 3, 7, 9, 8, 5];
 
merge_sort(&mut vec);
 
assert_eq!(vec, vec![1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);