clang-formatted the code

Author: Darshan-Baligeri

src/main/java/com/thealgorithms/shufflealogrithm/ConstrainedShuffle.java

@@ -1,7 +1,7 @@
 package com.thealgorithms.shufflealogrithm;
 
-import java.util.Collections;
 import java.util.ArrayList;
+import java.util.Collections;
 import java.util.List;
 
 public class ConstrainedShuffle {
@@ -13,24 +13,32 @@ public class ConstrainedShuffle {
      */
     public static void constrainedShuffle(int[] array) {
         // Edge case: Check if array has only one element (no valid shuffle possible)
-        if (array == null || array.length <= 1) return;
+        if (array == null || array.length <= 1) {
+            return;
+        }
 
         List<Integer> shuffledList = new ArrayList<>();
-        for (int num : array) shuffledList.add(num);
+        for (int num : array) {
+            shuffledList.add(num);
+        }
 
         do {
             Collections.shuffle(shuffledList);
         } while (!isValidShuffle(array, shuffledList));
 
-        for (int i = 0; i < array.length; i++) array[i] = shuffledList.get(i);
+        for (int i = 0; i < array.length; i++) {
+            array[i] = shuffledList.get(i);
+        }
     }
 
     /**
      * Verifies that no element is in its original position in the shuffled list.
      */
     private static boolean isValidShuffle(int[] original, List<Integer> shuffled) {
         for (int i = 0; i < original.length; i++) {
-            if (original[i] == shuffled.get(i)) return false;
+            if (original[i] == shuffled.get(i)) {
+                return false;
+            }
         }
         return true;
     }
@@ -45,4 +53,3 @@ public static void main(String[] args) {
         }
     }
 }
-

src/main/java/com/thealgorithms/shufflealogrithm/GroupShuffle.java

@@ -18,10 +18,14 @@ public static List<List<Integer>> groupShuffle(int[] array, int k) {
         List<List<Integer>> groups = new ArrayList<>();
 
         // Edge case: Check if grouping is possible
-        if (k > array.length || k <= 0) return groups;
+        if (k > array.length || k <= 0) {
+            return groups;
+        }
 
         List<Integer> shuffledList = new ArrayList<>();
-        for (int num : array) shuffledList.add(num);
+        for (int num : array) {
+            shuffledList.add(num);
+        }
         Collections.shuffle(shuffledList);
 
         int groupSize = array.length / k;
@@ -47,4 +51,3 @@ public static void main(String[] args) {
         }
     }
 }
-

src/main/java/com/thealgorithms/shufflealogrithm/ShuffleByRange.java

@@ -13,7 +13,9 @@ public class ShuffleByRange {
      */
     public static void shuffleRange(int[] array, int start, int end) {
         // Edge case handling
-        if (array == null || start < 0 || end >= array.length || start >= end) return;
+        if (array == null || start < 0 || end >= array.length || start >= end) {
+            return;
+        }
 
         Random random = new Random();
 
@@ -38,4 +40,3 @@ public static void main(String[] args) {
         }
     }
 }
-

src/main/java/com/thealgorithms/shufflealogrithm/UnderstandingShuffleAlgo.java

@@ -20,9 +20,9 @@ public static void shuffle(int[] array) {
             int j = random.nextInt(i + 1);
 
             // Swap the elements at positions i and j
-            int temp = array[i];   // Temporarily store the element at i
-            array[i] = array[j];   // Move element from j to i
-            array[j] = temp;       // Place the stored element in position j
+            int temp = array[i]; // Temporarily store the element at i
+            array[i] = array[j]; // Move element from j to i
+            array[j] = temp;     // Place the stored element in position j
         }
     }
 

src/main/java/com/thealgorithms/shufflealogrithm/UniquePairShuffle.java

@@ -20,7 +20,9 @@ public static List<int[]> pairShuffle(int[] array) {
         if (array.length % 2 != 0) return pairs;
 
         List<Integer> shuffledList = new ArrayList<>();
-        for (int num : array) shuffledList.add(num);
+        for (int num : array) {
+            shuffledList.add(num);
+        }
 
         // Shuffle elements to create random pairs
         Collections.shuffle(shuffledList);

src/main/java/com/thealgorithms/shufflealogrithm/WeightedShuffle.java

@@ -16,12 +16,16 @@ public static void weightedShuffle(int[] array, int[] weights) {
         if (array == null || weights == null || array.length != weights.length) return;
 
         Integer[] indices = new Integer[array.length];
-        for (int i = 0; i < array.length; i++) indices[i] = i;
+        for (int i = 0; i < array.length; i++) {
+            indices[i] = i;
+        }
 
         Arrays.sort(indices, Comparator.comparingInt(i -> -weights[i]));
 
         int[] result = new int[array.length];
-        for (int i = 0; i < array.length; i++) result[i] = array[indices[i]];
+        for (int i = 0; i < array.length; i++) {
+            result[i] = array[indices[i]];
+        }
 
         System.arraycopy(result, 0, array, 0, array.length);
     }
@@ -37,4 +41,3 @@ public static void main(String[] args) {
         }
     }
 }
-