Skip to content

BinarySearch: clearer median computation #2182

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

Merged
realDuYuanChao merged 2 commits into from
Apr 21, 2021
Merged

BinarySearch: clearer median computation #2182

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
c77d6df
BinarySearch: clearer median computation
allentiak Apr 14, 2021
3f3ba1f
update binary search
realDuYuanChao Apr 21, 2021
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 Searches/BinarySearch.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -45,7 +45,7 @@ private <T extends Comparable<T>> int search(T array[], T key, int left, int rig
if (right < left) return -1; // this means that the key not found

// find median
int median = left + ((right - left) >>> 1);
int median = left + ((right - left) / 2);
int comp = key.compareTo(array[median]);

if (comp == 0) {
Expand Down