Update sieve_of_eratosthenes.py

prakhar1989 · prakhar1989 · commit cb0f2e879102 · 2015-09-09T12:42:53.000-04:00
diff --git a/misc/sieve_of_eratosthenes.py b/misc/sieve_of_eratosthenes.py
@@ -1,13 +1,11 @@
 """
 Implementation of Sieve of Eratosthenes algorithm to generate all the primes upto N.
 
-Reference : https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
-
 Algorithm :
-* We have a list of numbers from 1 to N.
-* Initially, all the numbers are marked as primes.
-* We go to every prime number in the list (<= N ^ 1/2) and mark all the multiples 
-  of this prime number which are bigger than the number itself as non-primes.
+ * We have a list of numbers from 1 to N.
+ * Initially, all the numbers are marked as primes.
+ * We go to every prime number in the list (<= N ^ 1/2) and mark all the multiples 
+   of this prime number which are bigger than the number itself as non-primes.
 """
 
 from math import sqrt,ceil
@@ -20,6 +18,3 @@ def generate_primes(n):
                 bool_array[j] = False                     # and mark them as False
     primes = [i for i in range(n+1) if bool_array[i]]     # return all numbers which are marked as True
     return primes
-
-if __name__ == "__main__":
-    print(generate_primes(50))
