How to useOptimised Solution in Javascript
In this approach, we will use the fact that even numbers (except 2) cannot be prime can significantly optimize the process of finding prime numbers within a specified interval.
Example:
Javascript
let a, b, i, j; a = 5; b = 27; if (a <= 2) { a = 2; if (b >= 2) { console.log(a); a++; } } // Make sure that a is odd before // we begin the loop if (a % 2 == 0) a++; // Note: We traverse through odd numbers only for (i = a; i <= b; i = i + 2) { // flag variable to tell // if i is prime or not let flag = 1; // Traverse till square root of j // (Largest possible value of a prime factor) for (j = 2; j * j <= i; ++j) { if (i % j == 0) { flag = 0; break ; } } // flag = 1 means i is prime // and flag = 0 means i is not prime if (flag == 1) { if (i == 1) continue ; else console.log(i); } } |
5 7 11 13 17 19 23
Time Complexity: O(N*sqrt(N)), Where N is the difference between the range
Auxiliary Space: O(1)
JavaScript Program to Print All Prime Numbers in an Interval
In this article, we will explore a JavaScript program to find and print all prime numbers within a given range. A prime number is a natural number greater than 1, which is only divisible by 1 and itself. The first few prime numbers are 2 3 5 7 11 13 17 19 23…, The program efficiently identifies and displays prime numbers within the specified range.
There are several methods that can be used to Print All Prime Numbers in an Interval.
- Using Trial Division Method
- Optimized Solution
- Using the Sieve of Eratosthenes” algorithm
We will explore all the above methods along with their basic implementation with the help of examples.
Contact Us