Dynamic Programming vs. Divide-and-Conquer (2018)
trekhleb.dev15 June, 2018 7 min to read 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 … Read more