By bloid
via catonmat.net
Published: Nov 28 2008 / 22:03
This is the tenth post in an article series about MIT’s lecture course “Introduction to Algorithms.” In this post I will review lecture fifteen, which introduces the concept of Dynamic Programming and applies it to the Longest Common Subsequence problem.



Comments
pkrumins replied ago:
Thanks for posting, bloid!
Could you please fix a typo at the beginning of description: "MIT AlgorithmsThis is the tenth post..." There shouldn't be "MIT Algorithms" at the beginning.
(This typo resulted because my posts have a post icon at the beginning of each article and "MIT Algorithms" is the "alt" text. It got concatenated together with actual text of the article as you copy/pasted.)
bloid replied ago:
whoops...that was me being lazy and just double clicking the first paragraph to select it ;)
pkrumins replied ago:
Thanks!
Voters For This Link (8)
Voters Against This Link (0)