The Fibonacci Sequence
Task description
The Fibonacci sequence is a sequence Fn of natural numbers defined recursively:
F0 = 0
F1 = 1
Fn = Fn-1 + Fn-2, if n>1
Write a function to generate the nth Fibonacci number.
Solutions can be iterative or recursive (though recu...
picolisp-explored.com6 min read