Login
From:
trekhleb.dev
(Uncensored)
subscribe
Dynamic Programming vs Divide-and-Conquer | Trekhleb
https://trekhleb.dev/blog/2018/dynamic-programming-vs-divide-and-conquer/
links
backlinks
Roast topics
Find topics
Find it!
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)
