Sha256: 83d63a35c3fd1c10a523927684f642e1372b543f3f750861904f11feb87c46f8
Contents?: true
Size: 1.85 KB
Versions: 64
Compression:
Stored size: 1.85 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.
## Setup
Go through the setup instructions for JavaScript to
install the necessary dependencies:
http://exercism.io/languages/javascript
## Making the Test Suite Pass
Execute the tests with:
jasmine <exercise-name>.spec.js
Replace `<exercise-name>` with the name of the current exercise. E.g., to
test the Hello World exercise:
jasmine hello-world.spec.js
In many test suites all but the first test have been skipped.
Once you get a test passing, you can unskip the next one by
changing `xit` to `it`.
## 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
64 entries across 64 versions & 1 rubygems