Bot: Prettified Java code!

Author: JJ27

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

@@ -34,11 +34,11 @@ public static void main(String[] args) {
     }
 
     /**
-   * isPrime checks the primality of a given integer
-   * @param n The integer to check
-   * @param z Current Divisor(used for recursion)
-   * @return boolean true if prime and false if not
-   */
+     * isPrime checks the primality of a given integer
+     * @param n The integer to check
+     * @param z Current Divisor(used for recursion)
+     * @return boolean true if prime and false if not
+     */
     public static boolean isPrime(int n, int z) {
         //Check base cases
         if (n <= 2) return (n == 2) ? true : false;