What is the algorithm for getting prime numbers in between the range of n numbers?
Answers
Answered by
4
Following is the algorithm to find all the prime numbers less than or equal to a given integer n by Eratosthenes' method
Answered by
0
Answer:
A prime sieve or prime number sieve or sieve of Eratosthenes Method.
Explanation:
Sieve of Eratosthenes is a method or algorithm which is a basic calculation algorithm in mathematics or computer science the Sieve of Eratosthenes is a simple, ancient algorithm for calculating all prime numbers up to any given limit. It does so by iteratively marking as composite the multiples of each prime, starting with the first prime number, 2.
Similar questions