- Code: Select all
from time import *
def seuil(d):
t = monotonic()
n = 0
u = 2.
d = d**2
while (u-1)**2 >= d:
u = 1 + 1/((1-u) * (n+1))
n = n + 1
t = monotonic()-t
print("Time: {:.3f} seconds".format(t))
return [n, u]
Seuil Benchmark
2 posts
• Page 1 of 1
Seuil Benchmark
Numworks N0120 runs the Seuil benchmark in 0.197 seconds (d = 0.008) making it faster than the HP Prime for that particular program.
-
toml_12953
Niveau 2: MI2 (Membre Initié)- Posts: 5
- Joined: 02 Oct 2017, 15:41
- Gender:
- Calculator(s):→ MyCalcs profile
-
critorAdmin
Niveau 19: CU (Créateur Universel)- Posts: 41993
- Images: 15900
- Joined: 25 Oct 2008, 00:00
- Location: Montpellier
- Gender:
- Calculator(s):→ MyCalcs profile
- YouTube: critor3000
- Twitter: critor2000
- GitHub: critor
2 posts
• Page 1 of 1
Return to Programmation Python
Who is online
Users browsing this forum: ClaudeBot [spider] and 0 guests