Recursion in C language - using 2 programs example by Idris Mibweb

Recursion is the process which comes into existence when a function calls a copy of itself to work on a smaller problem. Any function which calls itself is called recursive function, and such function calls are called recursive calls. Recursion involves several numbers of recursive calls. However, it is important to impose a termination condition of recursion. Recursion code is shorter than iterative code however it is difficult to understand.

Recursion cannot be applied to all the problem, but it is more useful for the tasks that can be defined in terms of similar subtasks. For Example, recursion may be applied to sorting, searching, and traversal problems.

Generally, iterative solutions are more efficient than recursion since function call is always overhead. Any problem that can be solved recursively, can also be solved iteratively. However, some problems are best suited to be solved by the recursion, for example, tower of Hanoi, Fibonacci series, factorial finding, etc


social media to get the update, for files , for notes , last year questions and for notifications.

@Skillbout
Instagram: https://www.instagram.com/invites/contact/?i=1cnj1y2sev2ny&utm_content=9y2uwzp

Twitter:
https://twitter.com/SkillBout?s=08

Telegram:
SkillBout
Technical channel
https://t.me/mibweb

Facebook :
https://www.facebook.com/skill.bout.77

LinkedIn:
https://www.linkedin.com/in/skill-bout-775aa41b6