1/8
Flashcards about Recursion in Java
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
Recursion
A fundamental programming technique where a function calls itself to solve smaller instances of the same problem.
Recursive Definition
Solving a problem by reducing it to smaller versions of itself.
Base Case
The non-recursive part of a recursive definition, which provides a direct solution and stops the recursion.
Infinite Recursion
A situation where a recursive definition does not have a base case, leading to endless self-invocation.
Recursive Method
A method that calls itself.
Recursive Algorithm
An algorithm that solves a problem by reducing it to smaller instances of itself, implemented using recursive methods.
General Solution
Breaks a problem into smaller versions of itself.
General Case
A case in a recursive definition where a smaller version of itself is called, which must eventually be reduced to a base case.
Indirect Recursion
A method invoking another method, which invokes another, etc., until eventually the original method is invoked again.