-
Notifications
You must be signed in to change notification settings - Fork 268
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.
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
Adding Different Prime Algorithms #510
Comments
Hi Is this issue closed? I would like to work on it. |
@mohamedismail53 May I work on this? |
@mohamedismail53 I can work with this issue in python (I'll also provide time and space complexities and provide optimized code) |
I would be happy to contribute to the project as I find my skills a good fit for the issue . As a GSSOC 23 member I humbly ask to allow me to contribute to the issue. |
Hi Is this issue closed? I would like to work on it. |
Description of the problem
here I need to implement different prime algorithms the problem states that Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
Example of the problem
if n = 10
then primes [2, 3, 5, 7]
References/Other comments
https://www.geeksforgeeks.org/c-cpp-program-to-find-prime-numbers-between-given-range/
https://www.geeksforgeeks.org/sieve-of-eratosthenes/
I'm a Gssoc'22 participant
The text was updated successfully, but these errors were encountered: