rust-sort 0.1.4

Implementation of common sorting algorithms, purely for learning.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73

#![feature(test)]
extern crate rust_sort;
extern crate test;
extern crate utils;

use test::Bencher;
use rust_sort::selection_sort::sort;
use utils::*;

#[ignore]
#[bench]
fn selection_sort_10_000(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut RANDOM_10_000.clone())
    });
}
#[ignore]
#[bench]
fn selection_sort_10_000_few_keys(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut RANDOM_10_000_FEW_KEYS.clone())
    });
}
#[bench]
fn selection_sort_1000(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut RANDOM_1000.clone())
    });
}
#[bench]
fn selection_sort_1000_few_keys(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut RANDOM_1000_FEW_KEYS.clone())
    });
}
#[ignore]
#[bench]
fn selection_sort_presort_10_000(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut SORTED_10_000.clone())
    });
}
#[ignore]
#[bench]
fn selection_sort_presort_10_000_few_keys(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut SORTED_10_000_FEW_KEYS.clone())
    });
}
#[bench]
fn selection_sort_presort_1000(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut SORTED_1000.clone())
    });
}
#[bench]
fn selection_sort_presort_1000_few_keys(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut SORTED_1000_FEW_KEYS.clone())
    });
}
#[bench]
fn selection_sort_reverse_1000(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut REVERSE_1000.clone())
    });
}
#[bench]
fn selection_sort_reverse_1000_few_keys(b: &mut Bencher) {
    b.iter(|| {
        sort(&mut REVERSE_1000_FEW_KEYS.clone())
    });
}