added binary search

src/lib.rs

@@ -1,15 +1,24 @@
-
+mod search;
 mod sorting;
 
 #[cfg(test)]
 mod tests {
 
     use super::*;
-    use sorting::bubble::*;
+    use sorting::bubble_sort;
     #[test]
     fn test_bubble() {
-        let mut num = [4,3,2,1];
+        let mut num = [4, 3, 2, 1];
         bubble_sort(&mut num);
-        assert_eq!(num, [1,2,3,4])
+        assert_eq!(num, [1, 2, 3, 4])
+    }
+
+    use search::binary_search;
+    #[test]
+    fn test_binary_search() {
+        let test_arr = [1, 5, 6, 7, 22, 46, 76, 88, 96, 100];
+        for i in 0..test_arr.len() {
+            assert_eq!(i, binary_search(&test_arr, test_arr[i]).unwrap())
+        }
     }
 }

src/main.rs

@@ -1,4 +1,5 @@
 mod sorting;
+mod search;
 
 fn main() {
 

src/search/binary_search.rs

@@ -0,0 +1,19 @@
+pub fn binary_search(arr: &[i32], target: i32) -> Option<usize> {
+    let mut low = 0;
+    let mut high = arr.len() as i32 - 1;
+    while low <= high {
+        let mid = (high + low) / 2;
+        let m_index = mid as usize;
+        let val = &arr[m_index];
+        if *val == target {
+            return Some(m_index);
+        }
+        if *val < target {
+            low = mid + 1
+        }
+        if *val > target {
+            high = mid - 1
+        }
+    }
+    None
+}

src/search/mod.rs

@@ -0,0 +1,2 @@
+pub mod binary_search;
+pub use binary_search::*;

src/sorting/mod.rs

@@ -0,0 +1,2 @@
+pub mod bubble;
+pub use bubble::*;