time-to-botec

Benchmark sampling in different programming languages
Log | Files | Refs | README

commit 6454b2eeabdf28d85fc67b459e92f85297abfc6a
parent da9a10791fdda25a22bd6d2700497c2495a7bd32
Author: NunoSempere <nuno.sempere@protonmail.com>
Date:   Sun, 21 May 2023 01:24:02 -0400

tweak: decrease convergence constants for faster speed.

Diffstat:
Mwip/nim/samples | 0
Mwip/nim/samples.nim | 4++--
2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/wip/nim/samples b/wip/nim/samples Binary files differ. diff --git a/wip/nim/samples.nim b/wip/nim/samples.nim @@ -29,7 +29,7 @@ proc sine(x: float): float = ## Arithmetic-geomtric mean proc ag(x: float, y: float): float = - let n = 128 # just some high number + let n = 16 # just some high number var a = (x + y)/2.0 var b = sqrt(x * y) for i in 0..n: @@ -41,7 +41,7 @@ proc ag(x: float, y: float): float = ## Find m such that x * 2^m > 2^precision/2 proc find_m(x:float): float = var m = 0.0; - let precision = 64 # bits + let precision = 32 # bits let c = pow(2.0, precision.float / 2.0) while x * pow(2.0, m) < c: m = m + 1