hw1 question 7

TIME IN SECONDS N 0 0 0 0.29 3.25 36.18 Recursive vs Iterative 0 035 034 33 032 31 030 029 28 0.0127 26 0.0425 24 0.1623 4.0322 21 20 19 18 17 16 15 14 13 12 11 10 9 158 7 206 2554 353 2 401 0 45 Recursive Fib Sequnce in1250 seconds Iterative Fib Sequence in2500 seconds 5000 10000 Recursive Fib Sequnce in seconds Iterative Fib Sequence in seconds 4.03 3.25 15 0 0 0 20 0 0 0 25 0 0 0 35 0.29 0 0.29 0 40 3.25 0 0 45 0 36.18 0 # OF NUMBERS 0.16 0.04 0.01 1250 2500 5000 10000 0.01 0.04 0.16 4.03 1. Recursive Fibonnaci Sequence follows a factorial graph and grows extremely fast….run time will be INCREDIBLY slow after n grows much higher than 40. 2. Iterative Fibonnaci Sequence follows an exponential graph and grows much 'slower' than its factorial partner. Much faster but still gets slow after n gets into a range above 100k