TheAlgorithms
diff --git a/‎checkstyle.xml‎
Lines changed: 1 addition & 1 deletion b/‎checkstyle.xml‎
Lines changed: 1 addition & 1 deletion
diff --git a/‎src/main/java/com/thealgorithms/maths/DudeneyNumber.java‎
Lines changed: 3 additions & 3 deletions b/‎src/main/java/com/thealgorithms/maths/DudeneyNumber.java‎
Lines changed: 3 additions & 3 deletions
diff --git a/‎src/main/java/com/thealgorithms/sorts/SimpleSort.java‎
Lines changed: 3 additions & 3 deletions b/‎src/main/java/com/thealgorithms/sorts/SimpleSort.java‎
Lines changed: 3 additions & 3 deletions
@@ -109,7 +109,7 @@
     <!-- Checks for Naming Conventions.                  -->
     <!-- See https://checkstyle.org/checks/naming/index.html -->
     <module name="ConstantName"/>
-    <!-- TODO <module name="LocalFinalVariableName"/> -->
+    <module name="LocalFinalVariableName"/>
     <!-- TODO <module name="LocalVariableName"/> -->
     <!-- TODO <module name="MemberName"/> -->
     <!-- TODO <module name="MethodName"/> -->
 
@@ -16,13 +16,13 @@ public static boolean isDudeney(final int n) {
             throw new IllegalArgumentException("Input must me positive.");
         }
         // Calculating Cube Root
-        final int cube_root = (int) Math.round(Math.pow(n, 1.0 / 3.0));
+        final int cubeRoot = (int) Math.round(Math.pow(n, 1.0 / 3.0));
         // If the number is not a perfect cube the method returns false.
-        if (cube_root * cube_root * cube_root != n) {
+        if (cubeRoot * cubeRoot * cubeRoot != n) {
             return false;
         }
 
         // If the cube root of the number is not equal to the sum of its digits, we return false.
-        return cube_root == SumOfDigits.sumOfDigits(n);
+        return cubeRoot == SumOfDigits.sumOfDigits(n);
     }
 }
@@ -4,10 +4,10 @@ public class SimpleSort implements SortAlgorithm {
 
     @Override
     public <T extends Comparable<T>> T[] sort(T[] array) {
-        final int LENGTH = array.length;
+        final int length = array.length;
 
-        for (int i = 0; i < LENGTH; i++) {
-            for (int j = i + 1; j < LENGTH; j++) {
+        for (int i = 0; i < length; i++) {
+            for (int j = i + 1; j < length; j++) {
                 if (SortUtils.less(array[j], array[i])) {
                     T element = array[j];
                     array[j] = array[i];
Original file line number	Diff line number	Diff line change
@@ -16,13 +16,13 @@ public static boolean isDudeney(final int n) {
16	16	throw new IllegalArgumentException("Input must me positive.");
17	17	}
18	18	// Calculating Cube Root
19		- final int cube_root = (int) Math.round(Math.pow(n, 1.0 / 3.0));
	19	+ final int cubeRoot = (int) Math.round(Math.pow(n, 1.0 / 3.0));
20	20	// If the number is not a perfect cube the method returns false.
21		- if (cube_root * cube_root * cube_root != n) {
	21	+ if (cubeRoot * cubeRoot * cubeRoot != n) {
22	22	return false;
23	23	}
24	24
25	25	// If the cube root of the number is not equal to the sum of its digits, we return false.
26		- return cube_root == SumOfDigits.sumOfDigits(n);
	26	+ return cubeRoot == SumOfDigits.sumOfDigits(n);
27	27	}
28	28	}