clean up binary Search function

main.jl

@@ -37,23 +37,16 @@ end
 function binarySearch(word::String, words::Vector{String})
     left = 1
     right = length(words)
-    while right - left > 1
-        middle = ceil(Int, (right + left) / 2)
-        if words[middle] == word
-            return true, middle
-        elseif words[middle] < word
-            left = middle
+    while left < right
+        middle = floor(Int, (right + left) / 2)
+        if words[middle] < word
+            left = middle + 1
+        elseif words[middle] > word
+            right = middle - 1
         else
-            right = middle
+            return true, middle
         end
     end
-    middle = (right + left) / 2
-    if words[ceil(Int, middle)] == word
-        return true, ceil(Int, middle)
-    end
-    if words[floor(Int, middle)] == word
-        return true, floor(Int, middle)
-    end
     return false, 0
 end