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
use super::{Algorithm, Array};
pub struct Shellsort;
impl Algorithm for Shellsort {
fn sort(&self, array: Array) {
let len = array.len() as i64;
let mut gap = 1;
while gap < (len >> 1) {
gap = (gap << 1) + 1;
}
while gap >= 1 {
let mut i = gap;
while i < len {
let mut k = i - gap;
let mut j = i;
while j >= gap && array.get(j as usize) < array.get(k as usize) {
array.swap(j as usize, k as usize);
array.wait(10);
j = k;
k -= gap;
}
array.wait(10);
i += 1;
}
gap >>= 1;
}
}
fn name(&self) -> String {
"Shell sort".to_string()
}
}