class FindPrime {

    public static boolean isPrimeIter(int n) {
        if (n <= 0) {
            return false;
        }
        for (int i = 2; i < n; i++) {
            if (n % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static boolean isPrimeRecur(int n) {
        System.out.println("Checking if " + n + " is a prime");
        return isPrimeHelper(n, 2);
    }

    public static boolean isPrimeHelper(int n, int div) {
        if (n <= 0) {
            return false;
        }
        if (div >= n) {
            return true;
        }
        System.out.println("Checking if " + n + " is divisable by " + div);
        if (n % div == 0) {
            return false;
        }
        return isPrimeHelper(n, div+1);
    }


    public static void main(String[] args) {
        System.out.println(isPrimeIter(7));
        System.out.println(isPrimeRecur(7));
    }
}