Skip to content

Fix: Correct binary search high index to len -1 #312

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.

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
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
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 01_introduction_to_algorithms/c++/01_binary_search.cpp
Original file line number Diff line number Diff line change
@@ -4,7 +4,7 @@ using namespace std;
void binarySearch(int data_array[], int element, int len)
{
int low = 0;
int high = len;
int high = len -1;
while (low <= high)
{
int mid = (low + high)/2;
Binary file not shown.