Retired
Sieve of Eratosthenes(Nagendra) in Fastest Way (retired)
Description:
Hello friends
Given a number n, print all primes smaller than or equal to n.
It is also given that n is a small number.
For example, if n is 10, the output should be “2, 3, 5, 7”. If n is 20, the output should be “2, 3, 5, 7, 11, 13, 17, 19”.
Algorithms
Similar Kata:
Stats:
| Created | Jun 1, 2020 |
| Warriors Trained | 20 |
| Total Skips | 0 |
| Total Code Submissions | 28 |
| Total Times Completed | 16 |
| Python Completions | 16 |
| Total Stars | 0 |
| % of votes with a positive feedback rating | 12% of 13 |
| Total "Very Satisfied" Votes | 1 |
| Total "Somewhat Satisfied" Votes | 1 |
| Total "Not Satisfied" Votes | 11 |
| Total Rank Assessments | 9 |
| Average Assessed Rank | 7 kyu |
| Highest Assessed Rank | 6 kyu |
| Lowest Assessed Rank | 8 kyu |
