mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-22 01:02:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added Sieve of Eratosthenes for finding primes

Browse Source
This commit is contained in:
Rian Gallagher 2016-11-20 22:11:50 +00:00
parent 664b35252e
commit 4a6894c1fa
1 changed files with 0 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
other/FindingPrimes.py
View File

@ -16,6 +16,3 @@ def SOE(n):
for i in range(n+1): for i in range(n+1):
if(sieve[i] == True): if(sieve[i] == True):
print(i, end=" ") print(i, end=" ")
n = int(input("Enter a positive number\n"))
SOE(n)