👋Learning to code? Check out ourbrand new Bootcampfor beginners!
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.
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, first, write out all the numbers from 2 up to and including your given number. Then, follow these steps:
Repeat the steps until you've gone through every number. At the end, all the unmarked numbers are prime.
The Sieve of Eratosthenes marks off multiples of each prime using addition (repeatedly adding the prime) or multiplication (directly computing its multiples), rather than checking each number for divisibility.
The tests don't check that you've implemented the algorithm, only that you've come up with the correct primes.
Let's say you're finding the primes less than or equal to 10.
Write out 2, 3, 4, 5, 6, 7, 8, 9, 10, leaving them all unmarked.
2 3 4 5 6 7 8 9 10
2 is unmarked and is therefore a prime. Mark 4, 6, 8 and 10 as "not prime".
2 3 [4] 5 [6] 7 [8] 9 [10]
↑
3 is unmarked and is therefore a prime. Mark 6 and 9 as not prime (marking 6 is optional - as it's already been marked).
2 3 [4] 5 [6] 7 [8] [9] [10]
↑
4 is marked as "not prime", so we skip over it.
2 3 [4] 5 [6] 7 [8] [9] [10]
↑
5 is unmarked and is therefore a prime. Mark 10 as not prime (optional - as it's already been marked).
2 3 [4] 5 [6] 7 [8] [9] [10]
↑
6 is marked as "not prime", so we skip over it.
2 3 [4] 5 [6] 7 [8] [9] [10]
↑
7 is unmarked and is therefore a prime.
2 3 [4] 5 [6] 7 [8] [9] [10]
↑
8 is marked as "not prime", so we skip over it.
2 3 [4] 5 [6] 7 [8] [9] [10]
↑
9 is marked as "not prime", so we skip over it.
2 3 [4] 5 [6] 7 [8] [9] [10]
↑
10 is marked as "not prime", so we stop as there are no more numbers to check.
2 3 [4] 5 [6] 7 [8] [9] [10]
↑
You've examined all the numbers and found that 2, 3, 5, and 7 are still unmarked, meaning they're the primes less than or equal to 10.
You've not yet completed it in any languages.
