You are viewing a single comment's thread. Return to all comments →
This does not change the time complexity from O(n) however.
Orignal time is something like O(3n) -> O(n)
New time complexity is something like O(2n/3) -> O(n)
Seems like cookies are disabled on this browser, please enable them to open this website
I agree to HackerRank's Terms of Service and Privacy Policy.
Project Euler #2: Even Fibonacci numbers
You are viewing a single comment's thread. Return to all comments →
This does not change the time complexity from O(n) however.
Orignal time is something like O(3n) -> O(n)
New time complexity is something like O(2n/3) -> O(n)