Sha256: 730f810a2cc811c2864957eafef359b526ce1966d2e5193e958391cb9b6b80f0

Contents?: true

Size: 1.74 KB

Versions: 183

Compression:

Stored size: 1.74 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.

The Scala exercises assume an SBT project scheme. The exercise solution source
should be placed within the exercise directory/src/main/scala. The exercise
unit tests can be found within the exercise directory/src/test/scala.

To run the tests simply run the command `sbt test` in the exercise directory.

For more detailed info about the Scala track see the [help
page](http://exercism.io/languages/scala).


## 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

183 entries across 183 versions & 1 rubygems

Version Path
trackler-2.2.1.180 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.179 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.178 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.177 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.176 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.175 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.174 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.173 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.172 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.171 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.170 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.169 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.167 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.166 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.165 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.164 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.163 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.162 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.161 tracks/scala/exercises/sieve/README.md
trackler-2.2.1.160 tracks/scala/exercises/sieve/README.md