Yes, you do recall correctly. From section 1.8 of HOP (page 33 in my version):
Sometimes a problem appears to be naturally recursive, and then the recursive solution is grossly inefficient. A very simple example arises when you want to compute Fibonacci numbers. This is a rather unrealistic example, but it has the benefit of being very simple.
🦛
In reply to Re^5: How am i doing?
by hippo
in thread How am i doing?
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |