Dynamic Programming vs Divide-and-Conquer
https://itnext.io/dynamic-programming-vs-divide-and-conquer-2fea680becbe
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).
