Dynamic Programming or ‘Divide and Conquer’

The comparison will be made with the example of two algorithms: binary search (how to quickly find the number in the sorted array) and Levenshtein distances (how to convert one string to another with the minimum number of operations).
This article is just my personal attempt to decompose everything into shelves and understand what dynamic programming is and how the “divide and conquer" principle participates in it.

Link: https://dzone.com/articles/dynamic-programming-or-quotdivide-and-conquerquot?utm_medium=feed&utm_source=feedpress.me&utm_campaign=Feed%3A+dzone%2Fwebdev