Python: Saringan Eratosthenes

Akhirnya udah sedikit ngerti cara buat nge-list bilangan prima pake metode saringan Eratosthenes.

Karena aku mau belajar python, aku bikin pake python aja.ini source code nya. Ini cuma fungsi aja sih.

[sourcecode language="python"]
def find_prime(n):
"""
Return a list of prime number below n
Usage:
find_prime(10)
>>> [2, 3, 5, 7]
"""
primelist = []
for i in range(n + 1):
primelist.append(True)

primelist[0] = primelist[1] = False

batas = int(sqrt(n) + 1)
for i in range(2, batas + 1):
if primelist[i]:
for j in range(i*i, n + 1,i):
if (j % i == 0):
primelist[j] = False

myprime = []
for i in xrange(n + 1):
if primelist[i]:
myprime.append(i)

return myprime
[/sourcecode]