wren/test/benchmark/fib.py

from __future__ import print_function

import time

def fib(n):
  if n < 2: return n
  return fib(n - 1) + fib(n - 2)

start = time.process_time()
for i in range(0, 5):
  print(fib(28))
print("elapsed: " + str(time.process_time() - start))
Add python3 to benchmarks. 2014-02-12 17:22:42 -08:00			`from __future__ import print_function`

Get a basic benchmark runner going. 2013-11-22 08:55:22 -08:00			`import time`

Add trivial fib benchmark. 2013-11-14 20:57:56 -08:00			`def fib(n):`
			`if n < 2: return n`
			`return fib(n - 1) + fib(n - 2)`

Fix deprecated Python timing in benchmark & give more error info. (#844) - Note: process_time gives CPU time used and perf_counter is absolute time used. - Looks to have noise of about 1-2%. 2021-01-31 05:40:20 +00:00			`start = time.process_time()`
Get a basic benchmark runner going. 2013-11-22 08:55:22 -08:00			`for i in range(0, 5):`
Revise benchmarks: - Ditch JS since it's in a different league. - Make binary_trees and fib run faster. - Compare using best time instead of mean. 2013-12-12 16:59:57 -08:00			`print(fib(28))`
Fix deprecated Python timing in benchmark & give more error info. (#844) - Note: process_time gives CPU time used and perf_counter is absolute time used. - Looks to have noise of about 1-2%. 2021-01-31 05:40:20 +00:00			`print("elapsed: " + str(time.process_time() - start))`