refactor: refactor scaleRangeDifference statement

Author: Alex Klymenko

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

@@ -140,8 +140,8 @@ private <T extends Comparable<T>> Bucket<T>[] createBuckets(final int numBuckets
     private <T extends Comparable<T>> void distributeElements(final T[] array, final int left, final int right, final T min, final T max, final int numBuckets, final Bucket<T>[] buckets) {
         final double range = max.compareTo(min);
         for (int i = left; i <= right; i++) {
-            int scaleRangeDifference = array[i].compareTo(min) * numBuckets;
-            int bucketIndex = (int) (scaleRangeDifference/ (range + 1));
+            final int scaleRangeDifference = array[i].compareTo(min) * numBuckets;
+            int bucketIndex = (int) (scaleRangeDifference / (range + 1));
             buckets[bucketIndex].add(array[i]);
         }
     }