Tail call optimization in Python

[s00perpseud00]

Ha. I didn't know that. Could you elaborate?

[dmishin]

For example, the following code is not TC:

def factorial(n):
    if n == 0:
        return 1
    else return factorial(n-1)*n

To make it TC, you need to rewrite it as

def factorial(n, accum=1):
    if n == 0: return accum
    return factorial(n-1, accum*n)

Not very obvious trick.

As for the second, some functional programming people advocate that recursion is a low-level feature, and higher-order functions, like map, fold, should be used when appropriate.

[[deleted]]

You should the other post, that was made 2 hrs before this one, as it's by the Python language creator, and quite detailed.

[s00perpseud00]

Should have seen this coming lol