No description, website, or topics provided.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
eratosthenes.py tiny optimization Dec 21, 2018
naive.py improved a if condition Dec 21, 2018
readme.md initial commit Dec 21, 2018

readme.md

These are 2 different programs to generate all prime numbers between 0 and N. One is using a naive solution, the other is using the sieve of Eratosthenes algorithm.

I wrote a step by step tutorial on how this works here: lesscake.com/prime-numbers-eratosthenes.

To test the programs, simply run python naive.py or python eratosthese.py.