Inputs don't need to be sorted, but we have to change how the bottom up implementation populates the results array.

We can also simplify some of the statements by:

1) removing the call to list when we create the list 'items', as there's no need for it;
2) initializing the list items with zeros; and
3) removing the if statement in the nested loop, since it's not necessary anymore because of donnemartin#2.

We have to change the test too. We can't hardcode the labels to indices because they may be in a different position.

Range has to start at 1, otherwise, during the first row iteration, we're going to get values from the last row of table T (T[-1]).

We can simplify the insert method by removing the nested conditionals.

This reverts commit 37bb783.