sieve of eratosthenes

[Yash091]

🚀 Feature

Sieve of eratosthenes is the algorithm to find all the prime numbers less than or equal to a given integer n.

Have you read the Contribution Guidelines?

Yes

Pitch

Many companies focus on more advanced algorithms and sieve of eratosthenes is used frequently in many questions and is also an advanced algorithm.

Assignees

(Do not make changes in this section until asked to do so)
C - @gaurav1058 C# - @Osama-aj C++ - @Yash091 Go - @lucblassel Java - @sachin4627 Javascript -
Kotlin -
Python - @Noxbolt

[Yash091]

@manan025 I want to contribute in it in C++.

[manan025]

@Yash091 C++ assigned to you

[tarunkrjaiswal]

I want to work in Python

[manan025]

@Noxbolt python assigned

[lucblassel]

Hi I would like to give the go version a try if possible

[manan025]

@lucblassel - Go - Assigned

[sachin4627]

@manan025 I would like to contribute in java. Could you please assign it to me. Thanks You!!

[manan025]

@sachin4627 assigned Java

[gaurav1058]

@manan025 i would like to contribute in c.

[Osama-aj]

@manan025 sorry, I am new and this is my first hacktoberfest, so I just need to create a console app that detect all the prime numbers less than or equal to a given integer n using Sieve of Eratosthenes? if that so, I want to contribute in C#

[laxmipandey47]

@manan025 I want to contribute in C.

[manan025]

@Osama-aj Yes Assigned C# to you

[manan025]

@laxmipandey47 On the basis of first come, first serve, I'll have to give C to someone else.

[manan025]

@gaurav1058 - C