By bloid
via blogs.msdn.com
Published: Jan 20 2007 / 17:33
A Joel On Software reader asked the other day for examples of recursive functions other than old chestnuts like Fibonacci or factorial. Excellent question. I suggested topological sort, of course, but there are plenty of other examples that are way better than the Fibonacci numbers. Why do I think Fibonacci is bad? Read on.
Comments
daniel replied ago:
The article seemed to stop a bit short. I was expecting another good half-an-article.
pcx99 replied ago:
I always thought a binary tree was the best way to teach recursion, it's so easy to visualize node walking.
Voters For This Link (13)
Voters Against This Link (0)