Open Akash7649 opened 1 year ago
Hey @mr-ayush-agrawal I want to add a program Sieve Of Eratosthenes that finds all the prime numbers from 1 to n in O{n*log(log(n))) time complexity. So, please assign me this issue under the tag of Hacktoberfest2023.
Issue has been assigned to you :)
Hello @mr-ayush-agrawal, please assign this issue to me as I have already worked on this kind of problem in past and has a great experience.
Hey @mr-ayush-agrawal I want to add a program Sieve Of Eratosthenes that finds all the prime numbers from 1 to n in O{n*log(log(n))) time complexity. So, please assign me this issue under the tag of Hacktoberfest2023.