Question: Fun with Algorithms. Recall that Fibonacci numbers form a sequence Fn where F0=0,F1=1, and Fn=Fn1+Fn2. The standard algorithm for finding the n-th Fibonacci number takes

 Fun with Algorithms. Recall that Fibonacci numbers form a sequence Fn

Fun with Algorithms. Recall that Fibonacci numbers form a sequence Fn where F0=0,F1=1, and Fn=Fn1+Fn2. The standard algorithm for finding the n-th Fibonacci number takes O(n) time. The goal of this question is to design a significantly faster algorithm for this problem. (+10 points) (a) Prove by induction that for all n1 : [1110]n=[Fn+1FnFnFn1]. (b) Use the first part to design an algorithm that finds Fn in O(logn) time

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!