Primes from 1 to n
public class primerange {
public static boolean isprime(int n) {
for (int i = 2; i <= Math.sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
public static void primerange(int n) {
for (int i = 2; i <= n; i++) {
if (isprime(i)) {
System.out.println(i + " ");
}
}
System.out.println();
}
public static void main(String[] args) {
primerange(20);
}
}
Comments
Post a Comment