This repository is not active
maillouxc/LongestIncreasingSubsequence
A small project for my Discrete Math honors contract for university. The solution here uses dynamic programming and runs in n^2. An nLog(n) solution exists, but that is a problem for another day.
Java