pocketlang/tests/benchmarks/primes/primes.py

from time import process_time as clock

def is_prime(n):
	if n < 2 : return False
	for i in range(2, n):
		if n % i == 0 : return False
	return True

start = clock()

N = 30000; primes = []
for i in range(N):
	if is_prime(i):
		primes.append(i)

print("elapsed:", clock() - start, "s")
Iterations were heavily optimized 2021-05-24 06:17:52 +08:00			`from time import process_time as clock`

			`def is_prime(n):`
			`if n < 2 : return False`
			`for i in range(2, n):`
			`if n % i == 0 : return False`
			`return True`

			`start = clock()`

readme updated with preformance benchmarks 2021-05-31 08:01:41 +08:00			`N = 30000; primes = []`
Iterations were heavily optimized 2021-05-24 06:17:52 +08:00			`for i in range(N):`
			`if is_prime(i):`
			`primes.append(i)`

			`print("elapsed:", clock() - start, "s")`