Category:Sieve of Eratosthenes
The Sieve of Eratosthenes is an algorithm for rapidly locating all the prime numbers in a certain range of integers. It operates by marking as composite all nontrivial multiples of each prime in sequence until only primes remain unmarked. It is most well-suited to implementation using arrays, which are compact and feature random access.
Pages in category "Sieve of Eratosthenes"
The following 7 pages are in this category, out of 7 total.