Many mathematical axioms are based upon recursive rules. The Fibonacci sequence is another classic example of recursion:įib(0) = 0 as base case 1, Fib(1) = 1 as base case 2, For all integers n > 1, Fib( n) = Fib( n − 1) + Fib( n − 2). One's parent's ancestor ( recursive step).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |