The Recursion's answer is "the problem explains itself". This is a great tool when writing algorithms. Return from the list, where there are several examples of the words on their list. For example, the Fibonacci sequence is defined as: F(i) = F(i-1) + F(i-2)