👋Learning to code? Check out ourbrand new Bootcampfor beginners!
You bought a big box of random computer parts at a garage sale. You've started putting the parts together to build custom computers.
You want to test the performance of different combinations of parts, and decide to create your own benchmarking program to see how your computers compare. You choose the famous "Sieve of Eratosthenes" algorithm, an ancient algorithm, but one that should push your computers to the limits.
Your task is to create a program that implements the Sieve of Eratosthenes algorithm to find all prime numbers less than or equal to a given number.
A prime number is a number larger than 1 that is only divisible by 1 and itself. For example, 2, 3, 5, 7, 11, and 13 are prime numbers. By contrast, 6 is not a prime number as it not only divisible by 1 and itself, but also by 2 and 3.
To use the Sieve of Eratosthenes, you first create a list of all the numbers between 2 and your given number. Then you repeat the following steps:
You keep repeating these steps until you've gone through every number in your list. At the end, all the unmarked numbers are prime.
The tests don't check that you've implemented the algorithm, only that you've come up with the correct list of primes. To check you are implementing the Sieve correctly, a good first test is to check that you do not use division or remainder operations.
Let's say you're finding the primes less than or equal to 10.
You've examined all numbers and found 2, 3, 5, and 7 are still unmarked, which means they're the primes less than or equal to 10.
Edit via GitHub
Sign up to Exercism to learn and master Euphoria with 58 exercises, and real human mentoring, all for free.
We explore various approaches to the Sieve of Eratosthenes, starting with nested loops and lazy evaluation, then moving onto sets and finally looking at recursion.
