OneCompiler

Java program to print prime numbers.FAROOQ

290

import java.util.*;

public class main {
//to know it is prime or not
public static boolean isprime(int n) {
for (int i = 2; i <= Math.sqrt(n); i++) { //efficient for big numbers
if (n % i == 0) { //n%i reps remainder is n multiple of i i increses every time
return false; //if it is a multple return false not prime
}

    }
    return true;                             //return true when loop is completed 
}

public static void printPrims(int n) {
    for (int i = 2; i <= n; i++) {            
        if (isprime(i)) {                    //function callback inside function.
            System.out.println(i);          
        }
    }
}

public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    System.out.println("Enter num to get primes between 2 and num");
    int a=sc.nextInt();
    System.out.println("The primes are");
    printPrims(a);
}

}