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.

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

Open
mohamedismail53 opened this issue May 11, 2022 · 5 comments
Open

Adding Different Prime Algorithms #510

mohamedismail53 opened this issue May 11, 2022 · 5 comments

Comments

@mohamedismail53
Copy link

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

@ayushkl
Copy link

ayushkl commented May 15, 2023

Hi Is this issue closed? I would like to work on it.

@PoulasthaMukherjee
Copy link

@mohamedismail53 May I work on this?

@Veena4512
Copy link

@mohamedismail53 I can work with this issue in python (I'll also provide time and space complexities and provide optimized code)

@Meghaa702
Copy link

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.

@Vraj2811
Copy link

Vraj2811 commented Nov 2, 2024

Hi Is this issue closed? I would like to work on it.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

6 participants