This preview shows pages 1–5. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Last Updated 120124 10:12 AM CSE 2011 Prof. J. Elder  28  Binary Recursion Binary recursion occurs whenever there are two recursive calls for each nonbase case. Example 1: The Fibonacci Sequence Last Updated 120124 10:12 AM CSE 2011 Prof. J. Elder  29  The Fibonacci Sequence Fibonacci numbers are defined recursively: F = 0 F 1 = 1 F i = F i1 + F i2 for i > 1. (The Golden Ratio ) Fibonacci (c. 1170  c. 1250) (aka Leonardo of Pisa) The ratio F i / F i ! 1 converges to " = 1 + 5 2 = 1.61803398874989. .. Last Updated 120124 10:12 AM CSE 2011 Prof. J. Elder  30  The Golden Ratio Two quantities are in the golden ratio if the ratio of the sum of the quantities to the larger quantity is equal to the ratio of the larger quantity to the smaller one. ! is the unique positive solution to = a + b a = a b ....
View
Full
Document
This note was uploaded on 02/14/2012 for the course CSE 2011Z taught by Professor Elder during the Fall '11 term at York University.
 Fall '11
 Elder
 Data Structures, Recursion

Click to edit the document details