Fix clang-format issues in DoubleHashingSort

- Remove trailing spaces from all lines
- Fix inconsistent blank line formatting in comments
- Standardize JavaDoc comment spacing
- Ensure consistent indentation and line breaks
- Remove extra spaces after comment markers

Author: PauLopNun

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

@@ -8,14 +8,14 @@
  * Double Hashing Sort uses a hybrid approach combining hashing with traditional sorting.
  * It creates hash buckets using double hashing technique to distribute elements
  * and then sorts each bucket individually.
- * 
+ *
  * Time Complexity:
  * - Best Case: O(n) when elements are uniformly distributed
- * - Average Case: O(n log n)  
+ * - Average Case: O(n log n)
  * - Worst Case: O(n²) when all elements hash to same bucket
- * 
+ *
  * Space Complexity: O(n) for the auxiliary buckets
- * 
+ *
  * @author TheAlgorithms Team
  * @see <a href="https://en.wikipedia.org/wiki/Hash_function">Hash Function</a>
  */
@@ -35,7 +35,7 @@ public <T extends Comparable<T>> T[] sort(T[] array) {
 
     /**
      * Sorts array using double hashing technique
-     * 
+     *
      * @param array the array to be sorted
      * @param bucketCount number of buckets to use
      * @return sorted array
@@ -68,10 +68,10 @@ private <T extends Comparable<T>> T[] doubleHashingSort(T[] array, int bucketCou
                 @SuppressWarnings("unchecked")
                 T[] bucket = (T[]) new Comparable[bucketSizes[i]];
                 System.arraycopy(buckets[i], 0, bucket, 0, bucketSizes[i]);
-                
+
                 // Sort the bucket
                 Arrays.sort(bucket);
-                
+
                 // Copy back to main array
                 System.arraycopy(bucket, 0, array, index, bucketSizes[i]);
                 index += bucketSizes[i];
@@ -83,7 +83,7 @@ private <T extends Comparable<T>> T[] doubleHashingSort(T[] array, int bucketCou
 
     /**
      * Calculates bucket index using double hashing technique
-     * 
+     *
      * @param element the element to hash
      * @param bucketCount number of available buckets
      * @return bucket index
@@ -95,10 +95,10 @@ private <T extends Comparable<T>> int getBucketIndex(T element, int bucketCount)
 
         // Primary hash function
         int hash1 = Math.abs(element.hashCode()) % bucketCount;
-        
+
         // Secondary hash function (must be odd and different from bucket count)
         int hash2 = 7 - (Math.abs(element.hashCode()) % 7);
-        
+
         // Double hashing formula: (hash1 + i * hash2) % bucketCount
         // For simplicity, we use i = 1 here, but could be extended for collision resolution
         return (hash1 + hash2) % bucketCount;

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

@@ -4,7 +4,7 @@
  * Test class for DoubleHashingSort algorithm
  */
 public class DoubleHashingSortTest extends SortingAlgorithmTest {
-    
+
     @Override
     SortAlgorithm getSortAlgorithm() {
         return new DoubleHashingSort();