Skip to main content

All Questions

Filter by
Sorted by
Tagged with
9 votes
1 answer
6k views

Analyzing time complexity for change making algorithm (Brute force)

I'm new to analyzing time complexities and I have a question. To compute the nth fibonacci number, the recurrence tree will look like so: Since the tree can have a maximum height of 'n' and at every ...
Bugaboo's user avatar
  • 193