Please allow ads on our site
Please log in to access this content. You will be redirected to the login page shortly.
LoginWhat 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
I got this question in homework.
The question is from Recursion topic in section Argument Passing, Global vs Local Variables, Shallow copy vs Deep copy and Recursion of Python
Python Argument Passing in Python . 3 years ago
+10 pts
Correct OPTION is (d) A FUNCTION where the RECURSIVE call is the LAST thing executed by the function
For explanation: A recursive function is TAIL recursive when recursive call is executed by the function in the last.
Posted on 03 Dec 2021, this text provides information on Python related to Argument Passing in Python. Please note that while accuracy is prioritized, the data presented might not be entirely correct or up-to-date. This information is offered for general knowledge and informational purposes only, and should not be considered as a substitute for professional advice.
Take Quiz To Earn Credits!
Turn Your Knowledge into Earnings.
Answers
No matter what stage you're at in your education or career, TuteeHub will help you reach the next level that you're aiming for. Simply,Choose a subject/topic and get started in self-paced practice sessions to improve your knowledge and scores.
