From b8707e61cbdadd35609389c0d56c8777fe3cc8d9 Mon Sep 17 00:00:00 2001
From: Sourav Jyoti Kalita <31644207+Souravjyoti@users.noreply.github.com>
Date: Wed, 14 Apr 2021 09:20:48 +0530
Subject: [PATCH] Formula to find median in Binary Search changed (#2181)

* Formula to find median in BS changed

* Fixed bugs

* fixed binary search bug

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

diff --git a/Searches/BinarySearch.java b/Searches/BinarySearch.java
index b7dc37dc9..3bb9c562b 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) >>> 1;
+    int median = left + ((right-left) >>> 1);
     int comp = key.compareTo(array[median]);
 
     if (comp == 0) {