Oleksii Trekhleb personal blog
Dynamic Programming vs. Divide-and-Conquer (2018)
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)
- Points
- 214
- HN comments
- 115
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2021
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Apr 25, 2021 | Dynamic Programming vs. Divide-and-Conquer (2018) by trekhleb | 214 | 115 |
