Question

How to find whether a number is prime or not using recursion in Java

Answer 1

public class MyClass {
    static boolean isprime_recursion(int n, int i) {
        if (i == 1) {
            return true;
        }
        else {
           if (n % i == 0) {
             return false;
           }
           else {
             return isprime_recursion(n, i - 1);
           }       
        }
    }
    public static void main(String args[]) {
        int n = 23;
     
        if (isprime_recursion(n, n / 2) ) {
            System.out.println("Prime");
        }
        else {
            System.out.println("Not prime");
        }
    }
}



/*
run:

Prime

*/

 

70+ SQL courses for beginners and professionals