Sha256: 90f2363df33f0e2bbba6b325780a86a28b16f24f45ea386b7a2dfe09dee4a1a4
Contents?: true
Size: 1.61 KB
Versions: 107
Compression:
Stored size: 1.61 KB
Contents
# Sieve
Use the Sieve of Eratosthenes to find all the primes from 2 up to a given
number.
The Sieve of Eratosthenes is a simple, ancient algorithm for finding all
prime numbers up to any given limit. It does so by iteratively marking as
composite (i.e. not prime) the multiples of each prime,
starting with the multiples of 2.
Create your range, starting at two and continuing up to and including the given limit. (i.e. [2, limit])
The algorithm consists of repeating the following over and over:
- take the next available unmarked number in your list (it is prime)
- mark all the multiples of that number (they are not prime)
Repeat until you have processed each number in your range.
When the algorithm terminates, all the numbers in the list that have not
been marked are prime.
The wikipedia article has a useful graphic that explains the algorithm:
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
Notice that this is a very specific algorithm, and the tests don't check
that you've implemented the algorithm, only that you've come up with the
correct list of primes.
## Making the Test Suite Pass
1. Get [PHPUnit].
% wget --no-check-certificate https://phar.phpunit.de/phpunit.phar
% chmod +x phpunit.phar
2. Execute the tests for an assignment.
% phpunit.phar wordy/wordy_test.php
[PHPUnit]: http://phpunit.de
## Source
Sieve of Eratosthenes at Wikipedia [http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)
## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
107 entries across 107 versions & 1 rubygems