Studied by 109 peopleRecursion
A programming concept where a method calls itself during its execution.
Recursive call
The act of a method calling itself within its own code.
Base case
A condition in a recursive method that signals the termination of the recursion.
Forward progression
The movement through recursive calls from the initial call to the base case.
Backward progression
The movement through recursive calls from the base case back to the initial call.
Recursively Traversing Arrays
Using recursion to navigate through the elements of an array.
What happens when the base case is reached?
The execution of the current method is complete and the process repeats back to the initial recursive call.
In what order are recursive calls completed?
Once the base case is reached, the recursive calls are completed in backwards order.
Why is a base case important?
The base case ensures that the recursive method completes at some point, preventing an infinite loop.
How can you traverse arrays without using recursion?
Use a for, for each, or while loop.
Note
Flashcard