/SieveofEratosthenes

An algorithm for finding all prime numbers up to any given limit.

Primary LanguageJavaScriptMIT LicenseMIT

SieveofEratosthenes

The Sieve of Eratosthenes is a simple, ancient algorithm for finding all prime numbers up to any given limit.

Here is a Live Demo

Made this using JavaScript.

Check this out if you want to see the magic behind the curtains.

This implementation was inspired by this gif

Feel free to use it if you find it interesting.


May the force be with you