DSA Python Recursion Question 6

Last Updated :
Discuss
Comments

Observe the following Python code?

def a(n):

    if n == 0:

        return 0

    else:

        return n*a(n - 1)

def b(n, tot):

    if n == 0:

        return tot

    Else:

return b(n-2, tot-2)

Both a() and b() aren’t tail recursive

b() is tail recursive but a() isn’t

a() is tail recursive but b() isn’t

Both a() and b() are tail recursive

This question is part of this quiz :

Recursion in Python Quiz
Tags:
Python
Python-Quizzes
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy