From 367d7b32a2825f6e4c8ef3b5423ceb1cd2b62bd0 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Edvard=20Th=C3=B6rnros?= Date: Thu, 18 Feb 2021 20:12:06 +0100 Subject: Apply suggestions from code review MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Co-authored-by: Gustav Sörnäs --- progs/bench/fib.sy | 2 +- progs/bench/fib_iter.sy | 4 ++-- 2 files changed, 3 insertions(+), 3 deletions(-) (limited to 'progs/bench') diff --git a/progs/bench/fib.sy b/progs/bench/fib.sy index bd1aaa4..de68f5c 100644 --- a/progs/bench/fib.sy +++ b/progs/bench/fib.sy @@ -1,4 +1,4 @@ -// The worst implementation of fibonacci calculations +// The worst implementation of Fibonacci calculations // possible. FYI, it can be done in constant time. fib :: fn a:int -> int { if a < 2 { diff --git a/progs/bench/fib_iter.sy b/progs/bench/fib_iter.sy index 0e188e8..c51469a 100644 --- a/progs/bench/fib_iter.sy +++ b/progs/bench/fib_iter.sy @@ -1,5 +1,5 @@ -// A fibonacci implementation that is a little -// less awefull. But we run it 1000 times instead. +// A Fibonacci implementation that is a little +// less awful. But we run it 1000 times instead. j := 0 for , j < 1000, j = j + 1 { a := 0 -- cgit v1.2.1