https://github.com/nating/not-your-kitchen-sieve

2️⃣3️⃣ A graphical Sieve of Eratosthenes. 5️⃣7️⃣
https://github.com/nating/not-your-kitchen-sieve

java prime sieve-of-eratosthenes

Last synced: 2 months ago
JSON representation

2️⃣3️⃣ A graphical Sieve of Eratosthenes. 5️⃣7️⃣

• Host: GitHub
• URL: https://github.com/nating/not-your-kitchen-sieve
• Owner: nating
• Created: 2016-11-19T14:51:23.000Z (over 8 years ago)
• Default Branch: master
• Last Pushed: 2016-11-19T15:42:34.000Z (over 8 years ago)
• Last Synced: 2025-01-02T10:46:18.126Z (4 months ago)
• Topics: java, prime, sieve-of-eratosthenes
• Language: Java
• Size: 671 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# not-your-kitchen-sieve

A graphical representation of how the Sieve of Eratosthenes works. One of the first programs I wrote in my first year of Computer Science.

![Sieve](assets/Sieve.gif)

##Overview

The Sieve of Eratosthenes is a simple and efficient algorithm for finding small prime numbers. The user of the program can specify what number, N, they want all the primes beneath. Multiples of 1,2,3...√N are marked as not prime. Afterwards, all the non-marked numbers are known to be prime. This program makes use of the Standard Drawing Library, StdDraw.java.