In this assignment, you will implement and build an animation of either the Matrix Chain multiplication or the Longest Common Subsequence dynamic programming algorithms. Students whose last numeric digit of their gt account ends in an even number (e.g., gt1234a) will do the matrix chain algorithm. Students with odd-numbered finishing gt accounts will do the LCS algorithm.
These are involved algorithms, so try to make your animation explain well how they work. Obviously, an animation that simply shows a table of filled out values is not going to be that instructive. Your animation certainly may want to include that in some way, but it should do more than that. Try to be creative, but make it with a purpose.
Again, shortly before the assignment is due, I will post the input data for both algorithms to the newsgroup. You should run your program on this data, then turn in the corresponding Samba trace.