HaskellCourse/cm/myfibo.hs

-- Slide 15


-- Fibonacci recursive

fibo 0 = 1
fibo 1 = 1

fibo n = fibo (n - 2) + fibo (n - 1)


-- Factorial tail evaluation

f n = ft n 1

ft n acc = case n of
	0 -> acc
	_ -> ft (n - 1) (acc * n)