time-to-botec

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

commit 707f3d744bf5abb33071d2261b07719686e612b1
parent 7834c3baaeac5093ae0e2fb69ff41d08407e8213
Author: NunoSempere <nuno.sempere@protonmail.com>
Date:   Tue,  7 Nov 2023 22:31:28 +0000

fix: README tweaks

Diffstat:
MREADME.md | 2+-
1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md @@ -133,7 +133,7 @@ The beautiful thing about bc is that it's an arbitrary precision calculator: - it's not going to get floating point overflows, unlike practically everything else. Try `1000000001.0 ** 1000000.0` in OCaml, and you will get infinity, try p(1000000000.0, 1000000.0) and you will get a large power of 10 in bc. - you can always trade get more precision (at the cost of longer running times). Could be useful if you were working with tricky long tails. -I decided to go with [Gavin Howard's bc](https://git.gavinhoward.com/gavin/bc), because I've been following the guy some time, and I respect him. It also had some crucial extensions, like a random number generator and +I decided to go with [Gavin Howard's bc](https://git.gavinhoward.com/gavin/bc), because I've been following the guy some time, and I respect him. It also had some crucial extensions, like a random number generator and allowing specifying functions and variables with names longer than one letter. ### Overall thoughts