6. (15 分) Fibonacci numbers: Their recursive definitions are as follows:
Fn=0 if n=0; Fn=1 if n=1; Fn=1 if n=2; Fn=2Fn-1+ Fn-2+ Fn-3 if n≥3.
Design an O(lg n)-time algorithm to compute Fn.
阿摩線上測驗
登入
阿摩線上測驗
登入
6. (15 分) Fibonacci numbers: Their recursive definitions are as follows:
Fn=0 if n=0; Fn=1 if n=1; Fn=1 if n=2; Fn=2Fn-1+ Fn-2+ Fn-3 if n≥3.
Design an O(lg n)-time algorithm to compute Fn.