Then you get to have fun solving a recurrence relation. :-)

johndough · on Jan 16, 2021

If you don't like "fun", WolframAlpha can solve those for you. :-)

https://www.wolframalpha.com/input/?i=f%281%29+%3D+1%2C+f%28...

pmiller2 · on Jan 16, 2021

Sure, but if you're not on the spot in an interview, the master theorem is simple enough to apply: https://en.wikipedia.org/wiki/Master_theorem_(analysis_of_al...

commandnotfound · on Jan 16, 2021

Thank you, but for the link provided it only says that these are the Fibonacci numbers and nothing more. Yes, you can click on this F(n) (how can you even know this is a link), but anyways.