Format: Google java formatter

Author: github-actions

Searching/BinarySearch/BinarySearch.java

@@ -7,7 +7,7 @@ public static int search(int[] arr, int value) {
 
   /**
    * * Iterative Approach
-   * 
+   *
    * * TC: O(log n)
    * * SC: O(1)
    */
@@ -16,22 +16,17 @@ private static int binarySearch(int[] arr, int value, int low, int high) {
     while (low < high) {
       int mid = low + high - low / 2;
 
-      if (arr[mid] == value)
-        return mid;
-
-      else if (arr[mid] < value)
-        low = mid + 1;
-
-      else
-        high = mid - 1;
+      if (arr[mid] == value) return mid;
+      else if (arr[mid] < value) low = mid + 1;
+      else high = mid - 1;
     }
 
     return -1;
   }
 
   /**
    * * Recursive Approach
-   * 
+   *
    * * TC: O(log n)
    * * SC: O(log n)
    */
@@ -46,4 +41,4 @@ else if (arr[mid] < value)
 
   //   return binarySearch(arr, value, low, mid - 1);
   // }
-}
+}

Searching/BinarySearch/BinarySearchTest.java

@@ -2,23 +2,17 @@
 
 public class BinarySearchTest {
   public static void main(String[] args) {
-    
+
     int position = BinarySearch.search(new int[] {2, 6, 8, 10, 12, 13}, 10);
 
     // should be 3
     System.out.println(
-      position < 0 ? 
-        "\nValue not found in the array" :
-        "\nValue found at position: " + position
-    );
-    
+        position < 0 ? "\nValue not found in the array" : "\nValue found at position: " + position);
+
     position = BinarySearch.search(new int[] {2, 6, 8, 10, 12, 13}, 20);
 
     // Not found
     System.out.println(
-      position < 0 ? 
-        "\nValue not found in the array" :
-        "\nValue found at position: " + position
-    );
+        position < 0 ? "\nValue not found in the array" : "\nValue found at position: " + position);
   }
-}
+}