From b083f68386747a689291d63299d535392fce5454 Mon Sep 17 00:00:00 2001
From: Aaditrii <52820786+Aaditrii@users.noreply.github.com>
Date: Sat, 4 Jan 2020 11:19:44 +0530
Subject: [PATCH] more efficient method tp find middle element index

---
 Searching Algorithms/Binary Search.cpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Searching Algorithms/Binary Search.cpp b/Searching Algorithms/Binary Search.cpp
index 7c39ff6..8d6f9e1 100644
--- a/Searching Algorithms/Binary Search.cpp	
+++ b/Searching Algorithms/Binary Search.cpp	
@@ -32,7 +32,7 @@ inline int b_search(int left, int right, int x)
     int j = right;
     while (i < j)
     {
-        int mid = (i+j)/2;
+        int mid = left+(right-left)/2; //Suitable for bigger values of n 
         if (niz[mid] == x) return mid;
         if (niz[mid] < x) i = mid+1;
         else j = mid-1;