4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming
1,616,819 views
About this video
Hand-picked by a BrighterTube curator · found via ErikCH/DevYouTubeListSolves longest common subsequence first by plain recursion, then with a memo table, so the payoff of dynamic programming is explicit; Bari's worked example is easy to follow.
Longest common subsequence by recursion and by dynamic programming.
Video by Abdul Bari, played through YouTube's embedded player.
Part of Algorithms