style: Apply clang-format

Author: NarenCK11

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

@@ -21,12 +21,55 @@ public final class SmoothSort {
     /**
      * Private constructor to prevent instantiation of this utility class.
      */
-    private SmoothSort() {}
+    private SmoothSort() {
+    }
 
     // Leonardo numbers: L(0)=1, L(1)=1, L(k+2)=L(k+1)+L(k)-1
     // We store pre-calculated Leonardo numbers up to a reasonable limit.
     private static final int[] LP = {
-        1, 1, 3, 5, 9, 15, 25, 41, 67, 109, 177, 287, 465, 753, 1219, 1973, 3193, 5167, 8361, 13529, 21891, 35421, 57313, 92735, 150049, 242785, 392835, 635621, 1028457, 1664079, 2692537, 4356617, 7049155, 11405773, 18454929, 29860703, 48315633, 78176337, 126491971, 204668309, 331160281, 535828591, 866988873,
+        1,
+        1,
+        3,
+        5,
+        9,
+        15,
+        25,
+        41,
+        67,
+        109,
+        177,
+        287,
+        465,
+        753,
+        1219,
+        1973,
+        3193,
+        5167,
+        8361,
+        13529,
+        21891,
+        35421,
+        57313,
+        92735,
+        150049,
+        242785,
+        392835,
+        635621,
+        1028457,
+        1664079,
+        2692537,
+        4356617,
+        7049155,
+        11405773,
+        18454929,
+        29860703,
+        48315633,
+        78176337,
+        126491971,
+        204668309,
+        331160281,
+        535828591,
+        866988873,
     };
 
     /**
@@ -133,4 +176,4 @@ private static <T> void swap(T[] arr, int i, int j) {
         arr[i] = arr[j];
         arr[j] = temp;
     }
-}
+}

src/test/java/com/thealgorithms/sorts/SmoothSortTest.java

@@ -79,4 +79,4 @@ void testSortArrayWithNegativeNumbers() {
         SmoothSort.sort(array);
         assertArrayEquals(expected, array);
     }
-}
+}