We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b8707e6 commit 8cece6cCopy full SHA for 8cece6c
Searches/BinarySearch.java
@@ -45,7 +45,7 @@ private <T extends Comparable<T>> int search(T array[], T key, int left, int rig
45
if (right < left) return -1; // this means that the key not found
46
47
// find median
48
- int median = left + ((right-left) >>> 1);
+ int median = left + ((right - left) >>> 1);
49
int comp = key.compareTo(array[median]);
50
51
if (comp == 0) {
0 commit comments