Table of Contents

- 1 What happens if you call a recursive function without the second thing?
- 2 What happens when a recursive function does not have a proper exit condition?
- 3 Which of the following problems can’t be solved using recursion?
- 4 What causes a recursive function to end?
- 5 Which of the following problems can’t be solved using recursion factorial of a number problems without base case length of a string nth Fibonacci number?
- 6 Which of these is false about recursion?
- 7 How do you know if recursion is finite?
- 8 What is recursion algorithm?

## What happens if you call a recursive function without the second thing?

When using the function without the second return statement, the function yields no value to the callee per definition in JavaScript returns undefined .

### What happens when a recursive function does not have a proper exit condition?

Incase base condition or exit condition is not specified in the function then recursive calls to the function can lead to an infinite loop.

**What is likely to happen when a recursive function has no way of stopping is execution?**

Explain what is likely to happen when a recursive function that has no way of stopping executes. A stack overflow and a program crash.

**What error will most likely happen if there is no base case in a recursive function?**

Explanation: Recursions are always managed by using stack. 3. Which of these will happen if recursive method does not have a base case? Explanation: If a recursive method does not have a base case then an infinite loop occurs which results in Stack Overflow.

## Which of the following problems can’t be solved using recursion?

2. Which of the following problems can’t be solved using recursion? Explanation: Problems without base case leads to infinite recursion call. In general, we will assume a base case to avoid infinite recursion call.

### What causes a recursive function to end?

Recursive termination conditions A recursive termination is a condition that, when met, will cause the recursive function to stop calling itself. Because of the termination condition, countDown(1) does not call countDown(0) — instead, the “if statement” does not execute, so it prints “pop 1” and then terminates.

**What happens if there is no base case?**

Every recursive function must have at least one base case (many functions have more than one). If it doesn’t, your function will not work correctly most of the time, and will most likely cause your program to crash in many situations, definitely not a desired effect.

**Why is base case so important in a recursive function?**

The base case is a way to return without making a recursive call. In other words, it is the mechanism that stops this process of ever more recursive calls and an ever growing stack of function calls waiting on the return of other function calls.

## Which of the following problems can’t be solved using recursion factorial of a number problems without base case length of a string nth Fibonacci number?

Q. | Which of the following problems can’t be solved using recursion? |
---|---|

B. | nth fibonacci number |

C. | length of a string |

D. | problems without base case |

Answer» d. problems without base case |

### Which of these is false about recursion?

3. Which of these is false about recursion? Explanation: The speed of a program using recursion is slower than the speed of its non-recursive equivalent.

**What is the difference between a base case and recursive step?**

In a base case, we compute the result immediately given the inputs to the function call. In a recursive step, we compute the result with the help of one or more recursive callsto this same function, but with the inputs somehow reduced in size or complexity, closer to a base case. Consider writing a function to compute factorial.

**How does a recursive function call itself?**

A recursive function calls itself, the memory for a called function is allocated on top of memory allocated to calling function and different copy of local variables is created for each function call.

## How do you know if recursion is finite?

If every recursive step shrinks the problem, and the base case lies at the bottom, then the recursion is guaranteed to be finite. A recursive implementation may have more than one base case, or more than one recursive step. For example, the Fibonacci function has two base cases, n=0 and n=1. Recursive methods have a base case and a recursive step.

### What is recursion algorithm?

What is Recursion? The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function. Using recursive algorithm, certain problems can be solved quite easily.