← Back to questions
TCS NQT• Prep

Prime Numbers In Range

Here is the optimized solution in Java. Copy or view it below.
Java
package Problems_On_Number;

public class PrimeNumbersInRange {
    public static boolean isPrime(int num) {
        if (num == 1)
            return false;
        for (int i = 2; i < Math.sqrt(num); i++) {
            if (num % i == 0)
                return false;
        }
        return true;
    }

    public static void PrintPrimesbwrange(int a, int b) {
        for (int i = a; i <= b; i++) {
            if (isPrime(i)) {
                System.out.print(i + " ");
            }
        }
    }

    public static void main(String args[]) {
        int a = 10, b = 17;
        PrintPrimesbwrange(a, b);
    }
}