BAEL-5004 Fixed overflow issues for Large numbers (eugenp#10899)

Co-authored-by: Remy Ohajinwa <[email protected]>

Author: remyohajinwa

algorithms-searching/src/main/java/com/baeldung/algorithms/binarysearch/BinarySearch.java

@@ -12,7 +12,7 @@ public int runBinarySearchIteratively(int[] sortedArray, int key, int low, int h
 
         while (low <= high) {
 
-            int mid = (low + high) / 2;
+            int mid = low + ((high - low) / 2);
 
             if (sortedArray[mid] < key) {
                 low = mid + 1;
@@ -28,7 +28,7 @@ public int runBinarySearchIteratively(int[] sortedArray, int key, int low, int h
 
     public int runBinarySearchRecursively(int[] sortedArray, int key, int low, int high) {
 
-        int middle = (low + high) / 2;
+        int middle = low + ((high - low) / 2);
         if (high < low) {
             return -1;
         }