From d2d5efdd2a1e4de433ec382deaff6dba7807e477 Mon Sep 17 00:00:00 2001
From: Leandro Doctors <ldoctors@gmail.com>
Date: Tue, 20 Apr 2021 22:23:46 -0300
Subject: [PATCH] BinarySearch: clearer median computation (#2182)

* BinarySearch: clearer median computation

">>> 1" is simply too obscure...

* update binary search

Co-authored-by: Yang Libin <contact@yanglibin.info>

Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
Co-authored-by: Yang Libin <contact@yanglibin.info>
---
 Searches/BinarySearch.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Searches/BinarySearch.java b/Searches/BinarySearch.java
index 65f1606df..b7dc37dc9 100644
--- a/Searches/BinarySearch.java
+++ b/Searches/BinarySearch.java
@@ -45,7 +45,7 @@ class BinarySearch implements SearchAlgorithm {
     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) {