Does Python optimize tail recursion?

by

No, and it never will since Guido van Rossum prefers to be able to have proper tracebacks:

Tail Recursion Elimination (2009-04-22)

Final Words on Tail Calls (2009-04-27)

You can manually eliminate the recursion with a transformation like this:

>>> def trisum(n, csum):
...     while True:                     # Change recursion to a while loop
...         if n == 0:
...             return csum
...         n, csum = n - 1, csum + n   # Update parameters instead of tail recursion

>>> trisum(1000,0)
500500

More Related Contents:

  1. Why does Python have a maximum recursion depth?
  2. Recursive function returning none in Python [duplicate]
  3. Nested defaultdict of defaultdict
  4. Python recursion with list returns None [duplicate]
  5. Basics of recursion in Python
  6. How to do a recursive sub-folder search and return files in a list?
  7. Return in Recursive Function
  8. Python: Maximum recursion depth exceeded
  9. Recursion and return statements
  10. Can a lambda function call itself recursively in Python?
  11. How to flatten a nested JSON recursively, with flatten_json
  12. Using self.xxxx as a default parameter – Python
  13. Recursive function returning none? [duplicate]
  14. Setting property causes maximum recursion depth exceeded
  15. How to find common elements in list of lists?
  16. What is the hard recursion limit for Linux, Mac and Windows?
  17. Process finished with exit code -1073741571
  18. python recursive vectorization with timeseries
  19. Confusing […] List in Python: What is it?
  20. Python: using a recursive algorithm as a generator
  21. Generate all possible lists of length N that sum to S in Python
  22. Flattening a list recursively [duplicate]
  23. How can a recursive regexp be implemented in python?
  24. python recursive function that prints from 0 to n?
  25. Python: maximum recursion depth exceeded while calling a Python object
  26. Finding all maze solutions with Python
  27. Valid characters in a String
  28. Recursive Typing in Python 3.5+ [duplicate]
  29. Python Array Rotation
  30. Given a list of elements in lexicographical order (i.e. [‘a’, ‘b’, ‘c’, ‘d’]), find the nth permutation – Average time to solve?

Leave a Comment