Fix

Author: Hardvan

src/main/java/com/thealgorithms/misc/PalindromePrime.java

@@ -8,9 +8,15 @@ private PalindromePrime() {
     }
 
     public static boolean prime(int num) {
-        if (num < 2) return false; // Handle edge case for numbers < 2
-        if (num == 2) return true; // 2 is prime
-        if (num % 2 == 0) return false; // Even numbers > 2 are not prime
+        if (num < 2) {
+            return false; // Handle edge case for numbers < 2
+        }
+        if (num == 2) {
+            return true; // 2 is prime
+        }
+        if (num % 2 == 0) {
+            return false; // Even numbers > 2 are not prime
+        }
 
         for (int divisor = 3; divisor <= Math.sqrt(num); divisor += 2) {
             if (num % divisor == 0) {
@@ -31,7 +37,9 @@ public static int reverse(int n) {
 
     public static List<Integer> generatePalindromePrimes(int n) {
         List<Integer> palindromicPrimes = new ArrayList<>();
-        if (n <= 0) return palindromicPrimes; // Handle case for 0 or negative input
+        if (n <= 0) {
+            return palindromicPrimes; // Handle case for 0 or negative input
+        }
 
         palindromicPrimes.add(2); // 2 is the first palindromic prime
         int count = 1;