Added Sieve of Eratosthenes for finding primes

This commit is contained in:
Rian Gallagher 2016-11-20 22:11:50 +00:00
parent 664b35252e
commit 4a6894c1fa

View File

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