Primes in Range
Print all primes between two numbers.
package DSA.Functions;
import java.util.Scanner;
public class primeinRange { public static boolean prime(int n) { if (n == 2 || n == 1) { return true; } else { 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++) { boolean p = prime(i); if (p) { System.out.print(i + " "); } }
}
public static void main(String[] args) { try (Scanner sc = new Scanner(System.in)) { System.out.println("Enter the range upper limit:"); int n = sc.nextInt(); primeRange(n); } catch (Exception e) { System.out.println(e); } }}