Formatted with Google Java Formatter

Author: github-actions

Searches/BinarySearch.java

@@ -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) >>> 1);
     int comp = key.compareTo(array[median]);
 
     if (comp == 0) {