Computing - Recursion

Created: April 19, 2021

---

See Also

• [[Computing - Recursion]]^A

Flashcards

What are the three rules of recursion?

---

• Base condition
• The function calls itself
• Finite amount of runs

What is the main disadvantage of recursion?

---

It uses a lot of memory on the stack.

---

Related posts

• [[Computing - Recursion]]^A

  (outgoing)
• [[Computing - Syllabus]]^A

  (incoming)
• [[MAT - Paper 2010 - Q7]]^N

  (sim: 0.675)
• [[Computing - Misc]]^A

  (sim: 0.626)
• [[Computing - Functional Programming]]^A

  (sim: 0.487)
• [[Computing - Stacks]]^A

  (sim: 0.485)
• [[Lecture - Functional Programming MT22, VI]]^U

  (sim: 0.459)