-
Hi @strivedi4u,
I want to provide a java solution for the Sieve of Eratothenes algorithm which is used to count the number of primes till n.
Please assign me this issue under Hacktoberfest 2024.
-
## 🌟 Feature Overview
Add 10 simple python algorithms which we use in day-to-day life :-
- **Greatest Common Divisor (GCD) - Euclidean Algorithm**
- **Least Common Multiple (LCM)**
- **Sieve of Er…
-
### What would you like to share?
There's three entries in total for Sieve of Eratosthenes on the website, but the problem is that there's a primary one out of the three which has a majority of the i…
-
In the help notes for this "sieve" block included in the demos for the Streams library, you say "It's called SIEVE because the algorithm it uses is the Sieve of
Eratosthenes: https://en.wikipedia.org…
-
https://codeforces.com/blog/entry/54090
The blog presents a variant that uses a bool array instead of `lp`, so the space disadvantage over the Sieve of Eratosthenes is mitigated.
More helpfully,…
-
Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
Example:
Input : n =10
Output : 2 3 5 7
Input : n = 20
Output: 2 3 5 7 11 13 17…
-
Hello, Can I add Sieve of Eratosthenes in C++ and python?
-
## 🚀 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
Ma…
-
hey!
I would like to add Sieve of Eratosthenes problem in interview questions under hactoberfest2022.
please assign me!
-
Implement the Sieve of Eratosthenes algorithm in C++ together with a set of tests (talk to me if the test framework is unclear).
:gift: 1500