Fork me on GitHub

The solution for subword $i..j$ is stored at $M[i,j]$ where $M$ is a two-dimensional matrix. This results in a triangular matrix and wastes nearly half the allocated space. Compare this with the corresponding space-efficient strategy.

Delay: (try 0!)
(note: doesn't affect a running animation)
Word length: