Formula to find median in Binary Search changed (TheAlgorithms#2181)

* Formula to find median in BS changed

* Fixed bugs

* fixed binary search bug

Co-authored-by: Sourav <[email protected]>
Co-authored-by: Du Yuanchao <[email protected]>

Author: 3 people

Searches/BinarySearch.java

@@ -45,7 +45,7 @@ private <T extends Comparable<T>> int search(T array[], T key, int left, int rig
     if (right < left) return -1; // this means that the key not found
 
     // find median
-    int median = (left + right) >>> 1;
+    int median = left + ((right-left) >>> 1);
     int comp = key.compareTo(array[median]);
 
     if (comp == 0) {