|
package recursiond;
public class Prime {
//www.javapro.ir
public static void main(String[] arg) {
for (int i = 1; i < 25; i++) {
System.out.println(" " + i + " is prime " + isPrime(i, i - 1));
}
}
static boolean isPrime(int num, int div) {
if (div <= 1) {
return true;
}
if (num % div == 0) {
return false;
}
return isPrime(num, div - 1);
} }
|