Why recursion is not always good @mycodeschool

Why recursion is not always good @mycodeschool

Uploaded September 2012 | Updated September 2026, 2 weeks ago

See complete series on recursion here
youtube.com/playlist?list=PL2_aWCzGMAwLz3g66WrxFGSXvSsvyfzCO
Using the example of Fibonacci Sequence, we will show how a recursion can sometimes be easy to write but not good in terms of performance.

Prerequisite: basic knowledge of functions and recursion in programming

For more, visit our website: mycodeschool.com

Like us on Facebook: facebook.com/MyCodeSchool
Follow us on Twitter: twitter.com/mycodeschool

Why recursion is not always good

Selection sort algorithm

Data structures: Binary Tree

Data Structures: List as abstract data type

Linked List in C/C++ - Insert a node at nth position

Pointer types, pointer arithmetic, void pointers

Data structures: Introduction to Doubly Linked List

Bubble sort algorithm

Print elements of a linked list in forward and reverse order using recursion

Reverse a linked list using recursion

Pointers as function arguments - call by reference

Evaluation of Prefix and Postfix expressions using stack

Why recursion is not always good