Slightly rearrange methods n VampireNumber moving important bits closer to the beginning

Author: Shisoik

src/main/java/com/thealgorithms/maths/VampireNumber.java

@@ -13,26 +13,10 @@
  * @see <a href='https://en.wikipedia.org/wiki/Vampire_number'>Vampire number on Wikipedia</a>
  */
 public final class VampireNumber {
+    // Forbid instantiation.
     private VampireNumber() {
     }
 
-    public static void main(String[] args) {
-        printVampireNumbers(10, 1000, true);
-    }
-
-    static void printVampireNumbers(int startValue, int stopValue, boolean ignorePseudoVampireNumbers) {
-        int resultCounter = 0;
-
-        for (int i = startValue; i <= stopValue; i++) {
-            for (int j = i; j <= stopValue; j++) {
-                if (isVampireNumber(i, j, ignorePseudoVampireNumbers)) {
-                    resultCounter++;
-                    System.out.printf("%d: %d = %d * %d%n", resultCounter, i * j, i, j);
-                }
-            }
-        }
-    }
-
     static boolean isVampireNumber(int a, int b, boolean ignorePseudoVampireNumbers) {
         // Pseudo vampire numbers don't have to be of n/2 digits. E.g., 126 = 6 x 21 is such a number.
         if (ignorePseudoVampireNumbers && String.valueOf(a).length() != String.valueOf(b).length()) {
@@ -61,4 +45,21 @@ static String splitIntoSortedDigits(int... nums) {
         digits.stream().sorted().forEach(res::append);
         return res.toString();
     }
+
+    static void printVampireNumbers(int startValue, int stopValue, boolean ignorePseudoVampireNumbers) {
+        int resultCounter = 0;
+
+        for (int i = startValue; i <= stopValue; i++) {
+            for (int j = i; j <= stopValue; j++) {
+                if (isVampireNumber(i, j, ignorePseudoVampireNumbers)) {
+                    resultCounter++;
+                    System.out.printf("%d: %d = %d * %d%n", resultCounter, i * j, i, j);
+                }
+            }
+        }
+    }
+
+    public static void main(String[] args) {
+        printVampireNumbers(10, 1000, true);
+    }
 }