We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Instead of recursion I used this formula and it should cut down complexity quite a bit, but I still get two timeouts, so not sure what my algo is doing to be so slow.
Project Euler #2: Even Fibonacci numbers
You are viewing a single comment's thread. Return to all comments →
Instead of recursion I used this formula and it should cut down complexity quite a bit, but I still get two timeouts, so not sure what my algo is doing to be so slow.
Binet's Formula