refined code style issues and checked with clang format

Author: Darshan-Baligeri

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

@@ -15,7 +15,7 @@ private GroupShuffle() {
      * Returns an empty list if the group count exceeds the array length.
      *
      * @param array the input array to split into groups
-     * @param k the number of groups to create
+     * @param k     the number of groups to create
      * @return a list of groups, where each group is a shuffled sublist of the input array
      */
     public static List<List<Integer>> groupShuffle(int[] array, int k) {

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

@@ -13,7 +13,7 @@ private ShuffleByRange() {
      *
      * @param array the input array to shuffle
      * @param start starting index of the range to shuffle
-     * @param end ending index of the range to shuffle
+     * @param end   ending index of the range to shuffle
      */
     public static void shuffleRange(int[] array, int start, int end) {
         // Edge case handling

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

@@ -12,7 +12,7 @@ private WeightedShuffle() {
     /**
      * Shuffles elements based on their weights. Higher weight elements are more likely to appear earlier.
      *
-     * @param array the input array to shuffle
+     * @param array   the input array to shuffle
      * @param weights the weights for each corresponding element in the array
      */
     public static void weightedShuffle(int[] array, int[] weights) {