Fix range mid position detection in BinarySearch

anverbogatov · anverbogatov · commit 16d098cf7196 · 2022-03-13T20:49:53.000+04:00
diff --git a/src/main/java/com/anverbogatov/algorithms/search/BinarySearch.java b/src/main/java/com/anverbogatov/algorithms/search/BinarySearch.java
@@ -25,7 +25,7 @@ public static int binarySearch(int[] numbers, int value) {
         var high = numbers.length;
 
         while (true) {
-            var mid = (high + low) / 2;
+            var mid = low + (high - low) / 2;
             var temp = numbers[mid];
             if (temp == value) {
                 return mid;
