Function sort 

pub fn sort<T: Ord + Clone>(data: &mut [T])

Sorts a data set using Merge Sort

Average time complexity: O(n logn)

Examples

use sorting_algorithm::merge_sort;

fn main() {
    let mut data = [3, 1, 2, 5, 4];
     
    merge_sort::sort(&mut data);

    assert_eq!(data, [1, 2, 3, 4, 5]);
}