Usually fibonacci implementations runs O(n) or O(n^2) times. This repo has a variant of Fibonacci algo that computes the result in O(log N) times.
aasthadixit / most-efficient-fibonacci Goto Github PK
View Code? Open in Web Editor NEWUsually fibonacci implementations runs O(n) or O(n^2) times. This repo has a variant of Fibonacci algo that computes the result in O(log N) times.