TL;DR In this article I’m trying to explain the difference/similarities between dynamic programing and divide and conquer approaches based on two examples: binary search and minimum edit distance (Levenshtein distance). Also, in the Content-aware image resizing in JavaScript article I went through another powerful but yet simple example of dynamic programming for the Seam Carving algorithm. You mi