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.

Published by Mr. Dubey ⭐ 104.82K Points at 17-Sep-2023 10:11 am in Problem Solving and Python Programming

Explanation by: Mr. Dubey

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

💬 Discussion

📊 Question Analytics

👁️

489

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate