summaryrefslogtreecommitdiff
path: root/go/sieve/README.md
diff options
context:
space:
mode:
authorDimitri Sokolyuk <demon@dim13.org>2016-08-27 23:44:29 +0200
committerDimitri Sokolyuk <demon@dim13.org>2016-08-27 23:44:29 +0200
commita593ae4ca4e3af5c419461284c97a6cc91466d1b (patch)
treefda052eedb8036260a226cb61f15733e67b1a30f /go/sieve/README.md
parent4f1bb81b4401686fa8860756a68c81a7b292008a (diff)
Solve sieve
Diffstat (limited to 'go/sieve/README.md')
-rw-r--r--go/sieve/README.md45
1 files changed, 45 insertions, 0 deletions
diff --git a/go/sieve/README.md b/go/sieve/README.md
new file mode 100644
index 0000000..b76623b
--- /dev/null
+++ b/go/sieve/README.md
@@ -0,0 +1,45 @@
+# Sieve
+
+Write a program that uses 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.
+
+To run the tests simply run the command `go test` in the exercise directory.
+
+If the test suite contains benchmarks, you can run these with the `-bench`
+flag:
+
+ go test -bench .
+
+For more detailed info about the Go track see the [help
+page](http://exercism.io/languages/go).
+
+## Source
+
+Sieve of Eratosthenes at Wikipedia [http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes](http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)
+
+## Submitting Incomplete Problems
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+