Dynamic programming to find longest subset
Dynamic programming to find longest subset

Add function which uses dynamic programming to find the longest
strictly increasing subset from a set of elements in O(n^2) rather
than O(2^n) for the brute force approach.

Lionex/ISC4221