Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Tail recursion in Python.
def tail_factorial(n, accumulator=1): if n == 0: return 1 else: return tail_factorial(n-1, accumulator * n)
def tail_factorial(n, accumulator=1): if n == 0: return accumulator else: return tail_factorial(n-1, accumulator * n)