# This content is archived!

For the 2018-2019 school year, we have switched to using the WLMOJ judge for all MCPT related content. This is an archive of our old website and will not be updated.

# Introduction

Sieve is a very fast algorithm for generating prime numbers within a range. You can tell whether or not a number is prime in constant time (great for answering queries). However, the algorithm requires the use of a large array.

The algorithm is based on the fact that a multiple of a prime number, other than itself, cannot be a prime number.

First, a boolean array is created in the size up to the maximum number (we will call this number $M$) initialized to true, except for 0 and 1. The array holds whether or not the number has been discovered as a prime number.

Loop through all the numbers in the range $[2, \sqrt{M}]$, we will see why. If the current number is a prime, then loop through its multiples (we will call the current number $n$) and set their prime status to false. However, as an optimization, some of the multiples would have already been set to false, so we need not to start from $2n$. All the primes below $n^2$ would have already been found and their multiples processed. Thus, we can start the next loop from $n^2$. Similarly, we only need to loop through the numbers in the range $[2, \sqrt{M}]$ because after $\sqrt{M}$, any prime numbers found would only disprove the primeness of numbers that are past the range.

Depending on what we want to do, we can loop through the prime array again and generate a list of all the prime numbers. Or maybe we want to check whether or not a number is prime.

# Visualization

Visualization of the algorithm on the range $[1, 100]$. Gold indicates a prime number. The flashing row at the end shows that the search is done – all the numbers up to $\sqrt{100}=10$ have been checked.

# Implementation

## Time complexity

$\mathcal{O}(M \log \log M)$, where $M$ is the maximum to calculate to.

## Space complexity

$\mathcal{O}(M)$, where $M$ is the maximum to calculate to.