Comments on: Recursion & bad examples

By: Recursion | What Are You Looking For?

Recursion | What Are You Looking For? — Sun, 03 Apr 2011 02:00:29 +0000

[...] The better path is to take a survey of … http://blog.fogus.me/ Recursion & bad examples | Diovo Nov 6, 2009 Even though I agree that recursion is not the right way [...]

By: Qwerty

Qwerty — Thu, 17 Mar 2011 02:59:01 +0000

One of the first things I noticed when I read this article was the statement that modern PCs can’t even calculate the 50th Fibonacci number using recursion. Since I’m a person who likes a challenge, I got out my trusty 15 MHz calculator running a limited form of BASIC.

The result: It took slightly less than 10 seconds with a simple arbitrary precision addition routine to calculate the 100th Fibonacci number (354,224,848,179,261,915,075). I’m sure any modern computer running a practical language could do the same thing in under a second. Thinking it over, Assembly language would actually be the perfect language for such a routine.

Anyway, it’s more efficient (in higher level languages) to use a function that will return F(n), but recursion isn’t a half bad way to learn things like how to get around data limits.

By: sabithpocker

sabithpocker — Thu, 18 Feb 2010 22:07:54 +0000

We are not trying to ‘calculate’ Fibonacci numbers using computer.. are we?
We are instead studying a concept called ‘recursion’.

By: Jamie Wong

Jamie Wong — Sat, 12 Dec 2009 08:45:16 +0000

While the best algorithm for the generation of the fibonacci sequence is not a recursive algorithm, the fibonacci sequence is still a very useful example of explaining recursion. For people who are seeing recursion for the first time, it’s something very easy to visualize and has a low enough number of recursive calls as to make drawing the recursion tree feasible.

The way I’ve seen it taught in various places normally will use the fibonacci sequence as a segue into dynamic programming and memoization. Because the recursive algorithm is so terrible, it makes an excellent example of how performance can be drastically improved by preventing duplicate calls.

Factorial and addition do not lend themselves to such a segue, and are therefore less commonly used. Also, when doing introductory programming courses – doing factorial will be limited far sooner by the capacity of integers than it will be by computational complexity.

By: Niyaz PK

Niyaz PK — Sat, 12 Dec 2009 03:28:49 +0000

sabithpocker,

Even though the definition of Fibonacci is recursive, it does not mean that you can compute Fibonacci numbers using recursion.

By: sabithpocker

sabithpocker — Fri, 11 Dec 2009 17:10:32 +0000

First thing : stop thinking that those who make syllabus/curriculum are fools or outdated, they know more than you in programming(i refer to those who make syllabus and curriculum not your lecturer at coll)

Second thing : Before appreciating think not even once, but before criticizing think a thousand times.

Third thing : Search Google, Refer Wikipedia and then post what you feel ,ie. when you do tech blog.

Fourth point : Fibonacci is inherently recursive, find what is recursion in mathematics, recurrence relations and recursive functions.

Fifth point : I have made all of the above mentioned mistakes myself. Keep rocking dude!!

By: Niyaz PK

Niyaz PK — Sat, 07 Nov 2009 18:14:32 +0000

Binny,
As Amarghosh pointed out, factorial is a good example.

Another very simple example is addition:

add(0, x) = x, add(n, x) = add(n-1, x) + 1

As far as I know this example is often used in computer science courses in many good universities around the world.

I think Fibonacci should be taught as an example for bad use of recursion. Of course the point is that there is a huge time-space trade-off in using recursion and that should be taught correctly.