Recursion

When the problem has a large input size

When the problem requires complex data structures

When the problem can be solved using a loop construct

When the problem can be divided into smaller subproblems

Simplicity and linearity

Efficiency and optimization

Randomness and unpredictability

Repetition and redundancy

To improve the efficiency of the recursive algorithm

To modify the original input for each recursive step

To ensure that the base case is reached

To keep track of the recursive stack size

The base case

The recursive call

The return value

A loop

To store the base case of the recursive method

To invoke the method with different parameters

To store the intermediate results of the recursive calls

To execute the recursive method in a specific order

Recursive calls are more efficient than regular method calls

Recursive calls can only be used for mathematical operations

Recursive calls involve a method calling itself

Recursive calls use a different syntax than regular method calls

The function throws an error message

The function will stop when it reaches the end

The function returns immediately without executing any code

The function runs indefinitely

A technique to sort arrays in ascending order

A loop that iterates over a collection of elements

A method calling itself with different parameter values until a base case is reached

A method to calculate the average of a set of numbers

Recursion allows a method to call itself directly or indirectly

Recursion is always more efficient than iteration

Recursion can only be used with numerical data types

Recursion can only be used for sorting algorithms

Parameters determined at runtime

Different parameters

No parameters

The same parameters