/
sort.rs
172 lines (160 loc) · 5.16 KB
/
sort.rs
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
use std::collections::VecDeque;
use pyo3::exceptions::PyTypeError;
use pyo3::prelude::*;
fn _call_each_type_sort(fi: fn(&mut [i64]), ff: fn(&mut [f64]), fu8: fn(&mut [u8]), vec: PyObject) -> PyResult<PyObject> {
Python::with_gil(|py| {
if let Ok(mut vec) = vec.extract::<Vec<i64>>(py) {
fi(&mut vec);
return Ok(vec.to_object(py));
}
else if let Ok(mut vec) = vec.extract::<Vec<f64>>(py) {
ff(&mut vec);
return Ok(vec.to_object(py));
}
else if let Ok(vec) = vec.extract::<String>(py) {
let mut vec = vec.into_bytes();
fu8(&mut vec);
return Ok(String::from_utf8(vec).unwrap().to_object(py));
}
Err(PyTypeError::new_err("Not supported type"))
})
}
#[pyfunction]
pub fn bubble_sort(vec: PyObject) -> PyResult<PyObject> {
_call_each_type_sort(_bubble_sort::<i64>, _bubble_sort::<f64>, _bubble_sort::<u8>, vec)
}
fn _bubble_sort<T: Copy + PartialOrd>(vec: &mut [T]) {
for i in 0..vec.len()-1 {
for j in i..vec.len() {
if vec[i] > vec[j] {
let tmp = vec[i];
vec[i] = vec[j];
vec[j] = tmp;
}
}
}
}
#[pyfunction]
pub fn selection_sort(vec: PyObject) -> PyResult<PyObject> {
_call_each_type_sort(_selection_sort::<i64>, _selection_sort::<f64>, _selection_sort::<u8>, vec)
}
pub fn _selection_sort<T: Copy + PartialOrd>(vec: &mut [T]) {
for i in 0..vec.len()-1 {
let mut min_index: usize = i;
for j in i+1..vec.len() {
if vec[j] < vec[min_index] {
min_index = j;
}
}
let tmp = vec[i];
vec[i] = vec[min_index];
vec[min_index] = tmp;
}
}
#[pyfunction]
pub fn merge_sort(vec: PyObject) -> PyResult<PyObject> {
_call_each_type_sort(_merge_sort::<i64>, _merge_sort::<f64>, _merge_sort::<u8>, vec)
}
pub fn _merge_sort<T: Copy + PartialOrd>(vec: &mut [T]) {
let mut size = 1;
loop {
let mut end_loop = false;
size *= 2;
if size >= vec.len() {
end_loop = true;
}
for i in (0..vec.len()).step_by(size) {
if i + size/2 >= vec.len() {
continue;
}
let mut small_vec = Vec::with_capacity(size);
let mut right_limit = size/2;
if i + size >= vec.len() {
right_limit = vec.len() - i - size/2;
}
let mut left_index = 0;
let mut right_index = 0;
loop {
if left_index >= size/2 {
if right_index >= right_limit {
break;
}
small_vec.push(vec[i+size/2+right_index]);
right_index += 1;
}
else if right_index >= right_limit {
small_vec.push(vec[i+left_index]);
left_index += 1;
}
else if vec[i+left_index] < vec[i+size/2+right_index] {
small_vec.push(vec[i+left_index]);
left_index += 1;
}
else {
small_vec.push(vec[i+size/2+right_index]);
right_index += 1;
}
}
for j in 0..size {
vec[i+j] = small_vec[j];
if i + j >= vec.len() - 1 {
break;
}
}
}
if end_loop {
break;
}
}
}
#[pyfunction]
pub fn quick_sort(vec: PyObject) -> PyResult<PyObject> {
_call_each_type_sort(_quick_sort::<i64>, _quick_sort::<f64>, _quick_sort::<u8>, vec)
}
pub fn _quick_sort<T: Copy + PartialOrd>(vec: &mut [T]) {
struct BeginEnd {
begin: usize,
end: usize,
}
let mut queue = VecDeque::new();
queue.push_front(BeginEnd { begin: 0, end: vec.len() });
while queue.len() > 0 {
let range = queue.pop_back().unwrap();
let pivot_index = (range.begin+range.end) / 2;
let pivot = vec[pivot_index];
let mut left = range.begin;
let mut right = range.end - 1;
loop {
let mut goto_next_queue = false;
if vec[left] >= pivot {
loop {
if vec[right] <= pivot {
let tmp = vec[left];
vec[left] = vec[right];
vec[right] = tmp;
break;
}
right -= 1;
if right <= left {
goto_next_queue = true;
break;
}
}
}
if goto_next_queue {
break;
}
left += 1;
if right < left {
break;
}
}
if right - range.begin >= 2 {
queue.push_front(BeginEnd { begin: range.begin, end: right });
}
if range.end - right >= 2 {
queue.push_front(BeginEnd { begin: right, end: range.end });
}
//println!("from {} to {}: {:?}", range.begin, range.end, vec);
}
}