noko-sort 0.1.0

The Selection Sort Algorithm implemented in rust
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


pub fn sort_ascending(data: &str) -> Vec<i128> {
    let mut splitdat: Vec<i128> = data
        .split_whitespace()
        .map(|s| s.parse().expect("Parse error"))
        .collect();

    let mut sorted_values = Vec::new();
    let mut min_index;

    while !splitdat.is_empty() {
        min_index = 0;
        for i in 1..splitdat.len() {
            if splitdat[i] < splitdat[min_index] {
                min_index = i;
            }
        }
        sorted_values.push(splitdat.remove(min_index));
    }
    for (i, _val) in sorted_values.iter().enumerate() {
        if i > 0 {
            print!(" ");
        }
    }
    return sorted_values;
}

pub fn sort_descending(data: &str) -> Vec<i128> {
    let mut splitdat: Vec<i128> = data
        .split_whitespace()
        .map(|s| s.parse().expect("Parse error"))
        .collect();

    let mut sorted_values = Vec::new();
    let mut min_index;

    while !splitdat.is_empty() {
        min_index = 0;
        for i in 1..splitdat.len() {
            if splitdat[i] > splitdat[min_index] {
                min_index = i;
            }
        }
        sorted_values.push(splitdat.remove(min_index));
    }
    for (i, _val) in sorted_values.iter().enumerate() {
        if i > 0 {
            print!(" ");
        }
    }
    return sorted_values;
}