πŸ“Š Problem Solving and Python Programming
Q. 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
πŸ’¬ Discuss
βœ… Correct Answer: (D) a function where the recursive call is the last thing executed by the function

Explanation: a recursive function is tail recursive when recursive call is executed by the function in the last.


Explanation by: Mr. Dubey
a recursive function is tail recursive when recursive call is executed by the function in the last.

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
477
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
92%
Success Rate