Skip to main content

merge_sort

competitive::algorithm::sort

Function merge_sort 

Source 
fn merge_sort<T, F>(v: &mut [T], is_less: F)
where
    F: FnMut(&T, &T) -> bool,
Examples found in repository?
crates/competitive/src/algorithm/sort.rs (line 88)
84    fn merge_sort(&mut self)
85    where
86        T: Ord,
87    {
88        merge_sort(self, |a, b| a.lt(b));
89    }
90    fn merge_sort_by<F>(&mut self, mut compare: F)
91    where
92        F: FnMut(&T, &T) -> Ordering,
93    {
94        merge_sort(self, |a, b| compare(a, b) == Ordering::Less);
95    }