diff --git a/Searches/BinarySearch.java b/Searches/BinarySearch.java index b7dc37dc9..3bb9c562b 100644 --- a/Searches/BinarySearch.java +++ b/Searches/BinarySearch.java @@ -45,7 +45,7 @@ class BinarySearch implements SearchAlgorithm { if (right < left) return -1; // this means that the key not found // find median - int median = (left + right) >>> 1; + int median = left + ((right-left) >>> 1); int comp = key.compareTo(array[median]); if (comp == 0) {