Comments on: Understanding Recursion

By: Kamal Rawat

Kamal Rawat — Mon, 25 Feb 2013 05:34:46 +0000

In reply to anonymous. thanks..

By: anonymous

anonymous — Sat, 23 Feb 2013 07:39:49 +0000

Best explanation so far found on internet

By: Recursive function to traverse linked list in reverse order | ritambhara

Recursive function to traverse linked list in reverse order | ritambhara — Wed, 13 Jun 2012 11:43:40 +0000

[…] is an example of Head Recursion. In Head recursion the recursive function is called first and then perform the […]

By: Output of a recursive function | ritambhara

Output of a recursive function | ritambhara — Wed, 13 Jun 2012 11:29:12 +0000

[…] printing the remainders in reverse order (Tail Recursion). 00 Read more from C, C++ Recursion Click here to cancel […]

By: Output of a C function | Ritambhara

Output of a C function | Ritambhara — Tue, 12 Jun 2012 11:32:44 +0000

[…] is a classical example of both head recursion and tail recursion happening in the same function. You may also want to see my previous post on ‘Recursive […]

By: Recursive function to reverse a linked list | Ritambhara

Recursive function to reverse a linked list | Ritambhara — Tue, 12 Jun 2012 09:09:52 +0000

[…] Note, that Recursion comes with its own cost. to learn more, see this post… […]

By: Reversing a Singly Linked list | Ritambhara

Reversing a Singly Linked list | Ritambhara — Tue, 12 Jun 2012 08:59:59 +0000

[…] function to reverse the linked list is recursive, but as I said earlier that recursion comes with its costs. so its always better to recursive functions because of time and space […]

By: Mirror of a Binary Tree | Ritambhara

Mirror of a Binary Tree | Ritambhara — Tue, 12 Jun 2012 06:18:51 +0000

[…] I have written in my earlier posts also, Tree problems are better solved using recursion (But recursion comes with its side effect). Finding the Mirror can also be visualized […]