4 ms·

Why k > 2? k > 1 is bad enough. Otherwise, recursive fib(n) would be just fine (O(~1.618^n)).

• Retric 15y ago
  Because 1.00000000000001 ^ N is not bad for most values of N that you will actually use.