Difference between revisions of "Recursion"
Jump to navigation
Jump to search
| Line 2: | Line 2: | ||
<math>x = f(x)</math> | <math>x = f(x)</math> | ||
It is a reflexive structure and is the prototypical definition that defines [[fixed point]]. | It is a reflexive structure and is the prototypical definition that defines [[fixed point]]. | ||
=A good explanation= | |||
To get a general understanding of this topic, watch this video<ref>{{:Video/5 Simple Steps for Solving Any Recursive Problem}}</ref>. | |||
<noinclude> | <noinclude> | ||
Revision as of 06:31, 26 January 2022
Recursion is a reflexive structure that maps input to outputs in the following sense:
It is a reflexive structure and is the prototypical definition that defines fixed point.
A good explanation
To get a general understanding of this topic, watch this video[1].
References
- ↑ Reducible, ed. (Dec 12, 2019). 5 Simple Steps for Solving Any Recursive Problem. local page: Reducible.