![]() You can then prove your conjecture by induction. You solve this recurrence relation (using generating functions, for instance) and you'll end up with the answer.Īlternatively, you can draw the recursion tree, which will have depth n and intuitively figure out that this function is asymptotically O(2 n ). ![]() This is assuming that repeated evaluations of the same Fib(n) take the same time - i.e.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |