Gamified challenge · Sieve of Eratosthenes
The garden has plots numbered 1 to n. A plot holds a flower if its number is prime (greater than 1 and divisible only by 1 and itself); every other plot is a weed.
Write primes(n) that returns every prime from 2 to n inclusive, in increasing order. Example: primes(10) is [2, 3, 5, 7]; primes(1) is []. n is between 0 and 1000.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google