Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

sieve: implement exercise #188

Closed
NobbZ opened this issue Oct 5, 2017 · 2 comments
Closed

sieve: implement exercise #188

NobbZ opened this issue Oct 5, 2017 · 2 comments
Labels
hacktoberfest
Milestone
nextercism

Comments

@NobbZ
Copy link
Member

NobbZ commented Oct 5, 2017

Implement the sieve exercise

Use the Sieve of Eratosthenes to find all the primes from 2 up to a given number.
@NobbZ NobbZ mentioned this issue Oct 5, 2017
Closed
@AtelesPaniscus
Copy link
Contributor

See pull request #201. I hope it meets your requirements.

@NobbZ
Copy link
Member Author

NobbZ commented Oct 15, 2017

Closed by #201

@NobbZ NobbZ closed this as completed Oct 15, 2017
@NobbZ NobbZ added this to the nextercism milestone Oct 30, 2017
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
hacktoberfest
Projects
None yet
Milestone
nextercism
Development

No branches or pull requests
2 participants
@NobbZ @AtelesPaniscus