BinarySearch: clearer median computation (TheAlgorithms#2182)

allentiak · realDuYuanChao · yanglbme · web-flow · commit d2d5efdd2a1e · 2021-04-21T09:23:46.000+08:00
* BinarySearch: clearer median computation

"&gt;&gt;&gt; 1" is simply too obscure...

* update binary search

Co-authored-by: Yang Libin &lt;contact@yanglibin.info&gt;

Co-authored-by: Du Yuanchao &lt;shellhub.me@gmail.com&gt;
Co-authored-by: Yang Libin &lt;contact@yanglibin.info&gt;
diff --git a/Searches/BinarySearch.java b/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 - left) >>> 1);
+    int median = (left + right) >>> 1;
     int comp = key.compareTo(array[median]);
 
     if (comp == 0) {
