whalsey/cosc581_p1

This file contains code that will employ dynamic programming to find the longest palindromic subsequence of any text file.

cosc581_p1

This file contains code that will employ dynamic programming to find the longest palindromic subsequence of any text file.

Usage

1. Download the files
2. make
3. chmod +x test.sh
4. ./test.sh > out.csv

Resources

http://algorithms.tutorialhorizon.com/longest-palindromic-subsequence/
https://www.youtube.com/watch?v=_nCsPn7_OgI