Thanks to visit codestin.com
Credit goes to docs.rs

sort

Function sort 

Source
pub fn sort<T: Ord>(data: &mut [T])
Expand description

Sorts a data set using Comb Sort

Average time complexity: O(n logn)

ยงExamples

use sorting_algorithm::comb_sort;

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

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