Introduction to recursive functions: Revision history

From Applied Science

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

22 January 2025

21 April 2022

20 April 2022

  • curprev 02:3102:31, 20 April 2022Wikiadmin talk contribs 1,641 bytes +1,641 Created page with "In the introduction to functions' chapter we learned that, in computing, the definition of a function borrows the mathematical definition. We also learned that, much like in mathematics, a function can call another function. If you have wondered if a function can call itself, you were right and that's called recursion. The question about recursive algorithm's performance vs non recursive algorithms is not studied in this course, that is left for later disciplines. For no..."