- Notifications
You must be signed in to change notification settings - Fork 0
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.
maillouxc/LongestIncreasingSubsequence
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
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.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published