https://github.com/torvaney/sieve-of-erastosthenes

https://github.com/torvaney/sieve-of-erastosthenes

elm

Last synced: about 1 month ago
JSON representation

• Host: GitHub
• URL: https://github.com/torvaney/sieve-of-erastosthenes
• Owner: Torvaney
• Created: 2017-05-07T09:20:29.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2017-05-12T22:46:03.000Z (almost 8 years ago)
• Last Synced: 2024-11-12T12:45:54.369Z (3 months ago)
• Topics: elm
• Language: Elm
• Size: 1.95 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# The Sieve of Eratosthenes

A simple implementation of the sieve of Eratosthenes in Elm.

> In mathematics, the sieve of Eratosthenes, one of a number of prime number sieves, is a simple, ancient algorithm for finding all prime numbers up to any given limit. It does so by iteratively marking as composite (i.e., not prime) the multiples of each prime, starting with the multiples of 2.

[_Wikipedia_](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes)