User Tools

Site Tools


Sidebar

Welcome to DIDO WIKI

dido:public:ra:xapend:xapend.a_glossary:r:recursion

Recursion

Return to Glossary

*Recursion is the process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Traversals, DFS of Graph, etc. Source: https://www.geeksforgeeks.org/recursion/ ~~DISCUSSION:on|Outstanding Issues~~ ~~DISCUSSION:off~~

dido/public/ra/xapend/xapend.a_glossary/r/recursion.txt · Last modified: 2022/01/26 08:19 by nick
Translations of this page: