Post #1802296

bad: computation time for my code is O(n^3) good: it is almost *perfectly* O(n^3), the plot of n vs t is very neat. (n ^3 isn't great but it's probably liveable, next on the to-do list is memoising this function so I never have to run it twice on the same inputs)