|
1 | 1 | pub mod simple_challenges; |
2 | 2 | pub mod recursion; |
| 3 | +pub mod search; |
3 | 4 |
|
4 | 5 | #[cfg(test)] |
5 | 6 | mod tests { |
@@ -103,5 +104,30 @@ mod tests { |
103 | 104 | assert_eq!(fibonacci(28), 317811); |
104 | 105 | assert_eq!(fibonacci(35), 9227465); |
105 | 106 | } |
| 107 | + |
| 108 | + #[test] |
| 109 | + fn test_reverse() { |
| 110 | + assert_eq!(reverse("abcdef"), "fedcba"); |
| 111 | + assert_eq!(reverse("test"), "tset"); |
| 112 | + assert_eq!(reverse(""), ""); |
| 113 | + } |
| 114 | + } |
| 115 | + |
| 116 | + mod search { |
| 117 | + use crate::search::*; |
| 118 | + |
| 119 | + #[test] |
| 120 | + fn test_linear_search() { |
| 121 | + assert_eq!(linear_search(&[7, 4, 3, 1, 5], 3), 2); |
| 122 | + assert_eq!(linear_search(&[5, 3, 2, 3, 4, 5], 6), -1); |
| 123 | + assert_eq!(linear_search(&[], 6), -1); |
| 124 | + } |
| 125 | + |
| 126 | + #[test] |
| 127 | + fn test_binary_search_nums() { |
| 128 | + assert_eq!(binary_search_nums(&[1, 2, 3, 4, 5], 3), 2); |
| 129 | + assert_eq!(binary_search_nums(&[1, 2, 3, 3, 4, 5], 6), -1); |
| 130 | + assert_eq!(binary_search_nums(&[], 6), -1); |
| 131 | + } |
106 | 132 | } |
107 | 133 | } |
0 commit comments