kaustubhgupta / Hacktoberfest

This is for the information that the repository has been excluded by the Hacktoberfest team from the event. This was done to maintain the quality standards and promote good quality open source contributions.

MIT License

55 stars 278 forks source link

Sieve of Erathosthenes #635

Closed divya-rai-42 closed 2 years ago

divya-rai-42 commented 2 years ago

Description

Through this algorithm, prime numbers upto a given target can be found in O(nlog(log(n))) Example: n=16 Output: 2 3 5 7 11 13

Important Checklist

[x] I have read the contribution guidelines before making this issue.
[x] I have verified this issue program is not already implemented

Languages and Assignees:

[x] Python: @amitsat27
[x] Java: @Ankursehrawat15
[ ] C: @
[x] C++: @divya-rai-42

Notes

Anything you would like to discuss.

divya-rai-42 commented 2 years ago

@kaustubhgupta Sir, I would like to contribute to this issue.

Ankursehrawat15 commented 2 years ago

Sir, I would like to contribute to this issue in java.

kaustubhgupta commented 2 years ago

Sir, I would like to contribute to this issue in java.

Sure,

amitsat27 commented 2 years ago

@kaustubhgupta Sir I would like to contribute to this issue in python.

PrabhuRaamDev commented 2 years ago

I want to contribute in java. Please assign to me

kaustubhgupta commented 2 years ago

@kaustubhgupta Sir I would like to contribute to this issue in python.

done