Sieve of Eratosthenes Visualization

Click on Visualize button to see prime numbers from 1 to 100.

What is the Sieve of Eratosthenes?

The Sieve of Eratosthenes is an ancient algorithm used to find all prime numbers up to a specified integer. It is one of the most efficient ways to find small prime numbers and is named after the Greek mathematician Eratosthenes.

How it Works:

List all numbers from 2 to the maximum number you want to check.
Start with the first number (2) and mark all its multiples as non-prime.
Move to the next unmarked number and mark all its multiples as non-prime.
Repeat the process until you have processed each number in the list.
The remaining unmarked numbers are prime.

Visualization:

Click the "Visualize" button to see the Sieve of Eratosthenes in action. The numbers will be displayed in a 10x10 grid, and the algorithm will highlight each number as it processes them. Prime numbers will be highlighted in green, non-prime numbers in red, and numbers currently being processed in yellow.