refactor: delay get_middle invocation

rust/binary-search/src/lib.rs

@@ -2,10 +2,10 @@ pub fn find(array: &[i32], key: i32) -> Option<usize> {
     if array.is_empty() {
         return None
     }
+
     let mut left = 0;
     let mut right = array.len() - 1;
-    let mut middle = get_middle(left, right);
-    println!("left: {}, right: {}, middle: {}", left, right, middle);
+    let mut middle;
 
     while left <= right {
         middle = get_middle(left, right);

rust/binary-search/tests/binary-search.rs

@@ -57,7 +57,6 @@ fn nothing_is_found_in_an_empty_array() {
 }
 
 #[test]
-#[ignore]
 fn nothing_is_found_when_the_left_and_right_bounds_cross() {
     assert_eq!(find(&[1, 2], 0), None);
 }