ASCI-COEP / ASCI-COEP/hacktoberfest
Implement Sieve of Eratosthenes in Python
Open
hacktoberfest
- Dominant language
- Jupyter Notebook
- Stars
- 12
- Forks
- 117
- PR merge metrics
- No merged PRs in 30d
Description
Given a number n as input, implement a program to print all primes less than n, using Sieve of Eratosthenes in Python
Contributor guide
No contributing guide indexed for this repository
Research direction
No file, test, or entry point is named in the issue; start by locating the Python source or notebook used for algorithm implementations and check how input and output are handled. Done means a Python implementation uses the Sieve of Eratosthenes and prints every prime less than the supplied n.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- cli
- Issue type
- Feature
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 45/100