Bot: Prettified Java code!

Author: JJ27

src/com/codefortomorrow/advanced/chapter13/practice/PrimePractice.java

@@ -11,6 +11,4 @@
 as many numbers as they want until they enter -1.
 */
 
-public class PrimePractice {
-
-}
+public class PrimePractice {}

src/com/codefortomorrow/advanced/chapter13/solutions/PrimePractice.java

@@ -26,25 +26,21 @@ public static void main(String[] args) {
             System.out.print("Enter an integer to check: ");
             s = reader.nextInt();
             if (s != -1) {
-                if (isPrime(s, 2))
-                  System.out.println("That is a prime!");
-                else
-                  System.out.println("Not a prime!");
+                if (isPrime(s, 2)) System.out.println(
+                    "That is a prime!"
+                ); else System.out.println("Not a prime!");
             }
         }
     }
 
     //n is the number to check, z is the current number being divided
     public static boolean isPrime(int n, int z) {
         //Check base cases
-        if (n <= 2)
-          return (n == 2) ? true : false;
+        if (n <= 2) return (n == 2) ? true : false;
         //Ternary operator used there
-        if (n % z == 0)
-          return false;
+        if (n % z == 0) return false;
         //If z gets high enough that z > sqrt(n), then n is prime, because factors just repeat after
-        if (Math.pow(z, 2) > n)
-          return true;
+        if (Math.pow(z, 2) > n) return true;
 
         //If none of the above work
         return isPrime(n, z + 1);