Sieve of Eratosthenes

Easy

Algorithm to quickly find all primes from 2 to N

📊 Complexity

Type	Value
Average	O(n log log n)
Worst	O(n log log n)
Space	O(n)

🏷️ Tags

PrimeMathNumber Theory

📖 Introduction

The Sieve of Eratosthenes is a prime-finding algorithm invented by the ancient Greek mathematician Eratosthenes. Like sifting sand through a sieve, crossing out multiples one by one leaves only primes.

1/24

🧙‍♂️Magic of Finding Primes!

A fast way to find all primes from 2 to N! By "sieving out" multiples one by one, only primes remain! 🧙‍♂️

Sieve of Eratosthenes

Easy

Sieve of Eratosthenes

Algorithm to quickly find all primes from 2 to N

📊 Complexity

Type	Value
Average	O(n log log n)
Worst	O(n log log n)
Space	O(n)

🏷️ Tags

PrimeMathNumber Theory

📖 Introduction

1/24

🧙‍♂️Magic of Finding Primes!

A fast way to find all primes from 2 to N! By "sieving out" multiples one by one, only primes remain! 🧙‍♂️

🧙‍♂️Magic of Finding Primes!