Formatting has been fixed

Author: alx

src/main/java/com/thealgorithms/sorts/BinaryInsertionSort.java

@@ -11,7 +11,7 @@ public <T extends Comparable<T>> T[] sort(T[] array) {
 
             while (low <= high) {
                 final int mid = (low + high) >>> 1;
-                if (temp.compareTo(array[mid]) < 0 ) {
+                if (temp.compareTo(array[mid]) < 0) {
                     high = mid - 1;
                 } else {
                     low = mid + 1;