What is a recursive function?

A recursive function is a function that calls itself directly or indirectly.

Which of the following problems can be solved using recursion? A) Towers of Hanoi B) Bubble Sort C) Linear Search D) None of the above

A) Towers of Hanoi

Riddle: I can be called by myself, yet I need a base case to stop. What am I?

A recursive function

True or False: Recursion can only be used to solve problems that can also be solved with iterative methods.

True.

The base condition in recursion is crucial because it defines the ______.

Simplest instance of the problem that can be solved directly.

What is the time complexity of the recursive Fibonacci algorithm?

O(2ⁿ) in the worst case.

Which type of recursion is characterized by the recursive call being the last operation performed by the function?

Tailed Recursion

Fill-in-the-blanks: A stack overflow error in recursion occurs when the ______ is not defined or not reached.

Base case

True or False: Non-tailed recursion can be optimized by compilers to improve performance.

False. Non-tailed recursion cannot be optimized as tail recursion can.

In the factorial function, what is the base case when n is 0?

1

Which of the following is an example of indirect recursion? A) A function calling itself B) A function calling another function which calls the first function C) A loop D) None of the above

B) A function calling another function which calls the first function

Fill-in-the-blanks: Recursive programs generally take more time due to the overhead of ______.

Function calls and returns

What is the main disadvantage of using recursion compared to iteration?

Higher space requirements due to function call stack.

Riddle: I can traverse trees and solve the Tower of Hanoi, yet I may lead to stack overflow if I'm not careful. What am I?

Recursion

True or False: Every recursive function must have a base case to ensure termination.

True.

What is the result of calling the function fact(5) in a recursive factorial implementation?

120

Which of the following is NOT a type of recursion? A) Direct B) Indirect C) Tailed D) Infinite

D) Infinite

Fill-in-the-blanks: In a tail recursive function, the recursive call is the ______ operation performed by the function.

Last

What is the primary reason recursive functions can lead to stack overflow?

The base case is not defined or not reached.

True or False: Recursive algorithms always have better time complexity than their iterative counterparts.

False. Recursive algorithms can have worse time complexity.

What do you call recursion where a function calls itself without any intermediate function?

Direct Recursion

What is the primary role of the base condition in a recursive function?

It defines the simplest instance of the problem that can be solved directly.