algorithm_rust/
lib.rs

1///排序算法
2pub mod sort;
3
4///矩阵算法
5pub mod matrix;
6///子数组算法
7pub mod subarray;
8
9///查找算法
10pub mod search;
11
12
13///数据结构
14pub mod structure;
15
16
17///数学算法与变换
18pub mod math;
19#[cfg(test)]
20mod tests {
21    use crate::structure::LinkedList;
22    use crate::structure::LinkedListNode;
23    #[test]
24    fn test() {
25        let mut a = [1,2,3,0,5,7,9,8,32,299,100];
26        crate::sort::insertion_sort(&mut a);
27	assert_eq!(a,[0,1,2,3,5,7,8,9,32,100,299]);
28        let m = (3,[1,2,3,4,5,6,7,8,9]);
29        let n = crate::matrix::square_matrix_multiply(m,m);
30        assert_eq!(n,(3, [30, 36, 42, 66, 81, 96, 102, 126, 150]));
31
32        let q = [-3,1,2,-8,9,0,2,-10,-5,-20,40,-90];
33        let c = crate::subarray::merge_max_subarray(&q);
34	assert_eq!(c,(4, 10, 16));
35        let a = [0,1,3,6,124,232,1312312];
36        let c = crate::search::binary_search(&a,&7);
37        assert_eq!(c,Err(4));
38
39        let mut q = [1231,123,1234,125,3,3,56,745,856,0,4,867,1237,4564124,123];
40        crate::sort::heap_max_sort(&mut q);
41	assert_eq!(q,[0, 3, 3, 4, 56, 123, 123, 125, 745, 856, 867, 1231, 1234, 1237, 4564124]);
42
43        let mut q = [1231,123,1234,125,3,3,56,745,856,0,4,867,1237,4564124,123];
44        crate::sort::heap_min_sort(&mut q);
45	assert_eq!(q, [4564124, 1237, 1234, 1231, 867, 856, 745, 125, 123, 123, 56, 4, 3, 3, 0]);
46
47        let mut  a  = crate::structure::MaxPriorityQueue::new();
48        a.push(1);
49        a.push(8);
50        a.push(2);
51        a.push(4);
52        a.push(5);
53        assert_eq!(a.pop(),Some(8));
54	assert_eq!(a.pop(),Some(5));
55	assert_eq!(a.pop(),Some(4));
56	assert_eq!(a.pop(),Some(2));
57	assert_eq!(a.pop(),Some(1));
58	
59        let mut a = [1,2,3,0,5,7,9,8,32,299,100];
60        crate::sort::quicksort(&mut a);	
61	assert_eq!(a,[0,1,2,3,5,7,8,9,32,100,299]);
62
63        let mut a = [1,2,3,0,5,7,9,8,32,299,100];
64        crate::sort::count_sort(&mut a);
65	assert_eq!(a,[0,1,2,3,5,7,8,9,32,100,299]);
66
67        let mut a = [1,2,3,0,5,7,9,8,32,299,100];
68        crate::sort::radix_sort(&mut a);
69	assert_eq!(a,[0,1,2,3,5,7,8,9,32,100,299]);
70        
71        let mut a = [1,2,3,0,5,7,9,8,32,299,100];
72        crate::sort::pdqsort(&mut a);
73
74	assert_eq!(a,[0,1,2,3,5,7,8,9,32,100,299]);
75        let mut b = crate::structure::Stack::new();
76        b.push(1);
77        b.push(2);
78	assert_eq!(b.pop(),Some(2));
79	assert_eq!(b.pop(),Some(1));
80
81
82	let a = [1,2,3,0,5,7,9,8,32,299,100];
83	let c =crate::search::max_search(&a);
84
85	assert_eq!(c,9);	    
86	let c =crate::search::min_search(&a);
87	assert_eq!(c,3);
88
89	use crate::structure::Complex;
90	let a = Complex{real: 1, imag: 2};
91	let b = Complex{real: 2 ,imag: 3};
92	let c = a + b;
93	assert_eq!(c,Complex{real:3, imag: 5});
94	use crate::math::dft;
95	let signal = vec![0.0, 1.0, 0.0, 1.0]; // Input signal
96	let spectrum = dft(&signal);
97
98	for (k, value) in spectrum.iter().enumerate() {
99            println!("Frequency {}: {:?}", k, value);
100	}	
101
102	let matrix1 = crate::matrix::Matrix::new(2, 2, vec![vec![1.0, 2.0], vec![3.0, 4.0]]);
103	let matrix2 = crate::matrix::Matrix::new(2, 2, vec![vec![5.0, 6.0], vec![7.0, 8.0]]);
104
105	let sum_matrix = matrix1.clone() + matrix2.clone();
106	println!("{:?}", sum_matrix);
107
108	let diff_matrix = matrix1.clone() - matrix2.clone();
109	println!("{:?}", diff_matrix);	
110
111	fn test_add_method_1() {
112	    let mut planets = vec!["Mercury", "Venus", "Mars", "Jupiter", "Saturn", "Uranus"];
113	    use crate::structure::BinaryTree;
114	    let mut tree = BinaryTree::Empty;
115	    for planet in planets {
116		tree.add(planet);
117 }
118	    
119	    assert_eq!(tree.walk(),
120               vec!["Jupiter", "Mars", "Mercury", "Saturn", "Uranus", "Venus"]);
121	}
122	
123        }
124    
125}
algorithm_rust/lib.rs

algorithm_rust/
lib.rs
