anglais/tests/recursive_fib.ang

32 lines
480 B
Text

fibonacci_numbers := [
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377
]
fn fib(n: int) -> int {
if n < 2 {
return n
}
return fib(n-1) + fib(n-2)
}
n := 0
while n < fibonacci_numbers.length() {
print("-")
n = n + 1
}
# return to start of line (with carriage return \r)
print(char(0x0D))
x := 0
while x < fibonacci_numbers.length() {
n := fib(x)
assertEq(n, fibonacci_numbers.at(x))
print("*")
x = x + 1
}
println("")