Question

Hi Friends !! crt answer plz!!
What is tail recursion?
a) A recursive function that has two base cases
b) A function where the recursive functions leads to an infinite loop
c) A recursive function where the function doesn’t return anything and just prints the values
d) A function where the recursive call is the last thing executed by the function

#Keep smiling :)

Answer 1

Answer:

The tail recursion is basically using the recursive function as the last statement of the function. So when nothing is left to do after coming back from the recursive call, that is called tail recursion.

Answer 2

Answer:

Heyy mate..

Option d is the correct answer.

Tail Recursion. Recursive procedures call themselves to work towards a solution to a problem. A function call is said to be tail recursive if there is nothing to do after the function returns except return its value. Since the current recursive instance is done executing at that point, saving its stack frame is a waste.

I hope this helps U...

Follow mee and Brainlist mee.