An invocation made by a recursive procedure of itself, directly or through another procedure. Each invocation has its own arguments and local variables; a returning invocation supplies an output to its caller.
Ancestors (4)
Incoming links (27)
- Algorithm termination
- Auxiliary space
- Base case
- Destructive binary search tree flattening
- Divide-and-conquer algorithm
- Divide-and-conquer combination cost
- Factorial recursion and returning frames
- Matrix-chain split reconstruction
- Parameter passing
- Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Functional programming, design and analysis of algorithms / 1 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 1 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 1 / d / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2015 / Imperative programming (resit) / 1 / e / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Imperative programming (resit) / 2 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Imperative programming (resit) / 2 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 5 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 5 / d / iii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2018 / Imperative programming / 5 / d / ii / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 2 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 3 / f / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Functional programming, design and analysis of algorithms (resit) / 5 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 5 / a / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 5 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2023 / Imperative programming / 2 / e / Solution
- Recursion (computer science)
- Recursion invariant
- Well-founded progress in recursion
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.