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.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

This repository is not active

About

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.


Languages

Language:Java 100.0%