rsort 2.1.0

perform different sorting algorithms on lists of numbers
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155

pub fn bubble_sort(vec: &Vec<i32>) -> Vec<i32> {
    let mut vec_new = vec.to_vec();
    let mut swapped: bool = true;
    while swapped {
        swapped = false;
        for i in 1..vec_new.len() {
            if vec_new[i-1] > vec_new[i] {
                vec_new.swap(i-1, i);
                swapped = true;
            }
        }
    }
    vec_new
}

pub mod mod_merge {
    use std::sync::mpsc;
    use std::thread;

    pub fn merge_sort_float(vec: &Vec<f32>) -> Vec<f32> {
        if vec.len() < 2 {
            vec.to_vec()
        } else {
            let size = vec.len() / 2; 
            let vec_copy: Vec<f32> = vec.to_vec(); // copy vec cause ownership
            let (tx, rx) = mpsc::channel(); // create channel

            let handle = thread::spawn(move || { // create new thread
                let left = merge_sort_float(&vec_copy[0..size].to_vec()); // recurse
                tx.send(left).unwrap(); // send new array
            });

            let left = rx.recv().unwrap(); // recieve new array

            let size = vec.len() / 2;
            let vec_copy: Vec<f32> = vec.to_vec(); // copy vec cause ownership
            let (tx, rx) = mpsc::channel(); // re-establish channel

            let handle2 = thread::spawn(move || { // spawn new thread
                let right = merge_sort_float(&vec_copy[size..].to_vec()); // recurse
                tx.send(right).unwrap(); // send new array
            });

            let right = rx.recv().unwrap();
            
            handle.join().unwrap();
            handle2.join().unwrap();

            let merged = merge_float(&left, &right);
            
            merged
        }
    }

    fn merge_float(left: &Vec<f32>, right: &Vec<f32>) -> Vec<f32> {
        let mut l = 0;
        let mut r = 0;
        let mut merged: Vec<f32> = Vec::new();

        while l < left.len() && r < right.len() {
            if left[l] < right[r] {
                merged.push(left[l]);
                l = l + 1;
            } else {
                merged.push(right[r]);
                r = r + 1;
            }
        }
        
        if l < left.len() {
            while l < left.len() {
                merged.push(left[l]);
                l = l +1;
            }
        }

        if r < right.len() {
            while r < right.len() {
                merged.push(right[r]);
                r = r + 1;
            }
        }
        
        merged
    }
    
    pub fn merge_sort(vec: &Vec<i32>) -> Vec<i32> {
        if vec.len() < 2 {
            vec.to_vec()
        } else {
            let size = vec.len() / 2; 
            let vec_copy: Vec<i32> = vec.to_vec(); // copy vec cause ownership
            let (tx, rx) = mpsc::channel(); // create channel

            let handle = thread::spawn(move || { // create new thread
                let left = merge_sort(&vec_copy[0..size].to_vec()); // recurse
                tx.send(left).unwrap(); // send new array
            });

            let left = rx.recv().unwrap(); // recieve new array

            let size = vec.len() / 2;
            let vec_copy: Vec<i32> = vec.to_vec(); // copy vec cause ownership
            let (tx, rx) = mpsc::channel(); // re-establish channel

            let handle2 = thread::spawn(move || { // spawn new thread
                let right = merge_sort(&vec_copy[size..].to_vec()); // recurse
                tx.send(right).unwrap(); // send new array
            });

            let right = rx.recv().unwrap();
            
            handle.join().unwrap();
            handle2.join().unwrap();

            let merged = merge(&left, &right);
            
            merged
        }
    }

    fn merge(left: &Vec<i32>, right: &Vec<i32>) -> Vec<i32> {
        let mut l = 0;
        let mut r = 0;
        let mut merged: Vec<i32> = Vec::new();

        while l < left.len() && r < right.len() {
            if left[l] < right[r] {
                merged.push(left[l]);
                l = l + 1;
            } else {
                merged.push(right[r]);
                r = r + 1;
            }
        }
        
        if l < left.len() {
            while l < left.len() {
                merged.push(left[l]);
                l = l +1;
            }
        }

        if r < right.len() {
            while r < right.len() {
                merged.push(right[r]);
                r = r + 1;
            }
        }
        
        merged
    }
}