algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-08 02:04:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

BinarySearch: clearer median computation (#2182)

Browse Source 
* BinarySearch: clearer median computation

">>> 1" is simply too obscure...

* update binary search

Co-authored-by: Yang Libin <contact@yanglibin.info>

Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
Co-authored-by: Yang Libin <contact@yanglibin.info>
This commit is contained in:
Leandro Doctors
2021-04-20 22:23:46 -03:00
committed by GitHub
parent 02fab665de
commit d2d5efdd2a
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Searches/BinarySearch.java
View File

@ -45,7 +45,7 @@ class BinarySearch implements SearchAlgorithm {
if (right < left) return -1; // this means that the key not found if (right < left) return -1; // this means that the key not found
// find median // find median
int median = left + ((right - left) >>> 1); int median = (left + right) >>> 1;
int comp = key.compareTo(array[median]); int comp = key.compareTo(array[median]);
if (comp == 0) { if (comp == 0) {