Skip to content

more efficient method to find middle element index #25

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Aaditrii wants to merge 1 commit into
base: master
Choose a base branch
from
+1 −1
Open

more efficient method to find middle element index #25

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Searching Algorithms/Binary Search.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down