rusyasoft
diff --git a/‎README.md
Copy file name to clipboardExpand all lines: README.md
+4Lines changed: 4 additions & 0 deletions b/‎README.md
Copy file name to clipboardExpand all lines: README.md
+4Lines changed: 4 additions & 0 deletions
@@ -91,4 +91,8 @@ Your best tools as a programmer: control flow. Looping is the quintenscence of y
 >* **Polymorphism** means one name many forms. It is further of two types — static and dynamic. Static polymorphism is achieved using method overloading and dynamic polymorphism using method overriding. It is closely related to inheritance. We can write a code that works on the superclass, and it will work with any subclass type as well.
 
 [_Wikipedia_](https://en.wikipedia.org/wiki/Object-oriented_programming), [_Medium_](https://medium.com/@cancerian0684/what-are-four-basic-principles-of-object-oriented-programming-645af8b43727)
+### Dynamic Programming
+>Dynamic programming is both a mathematical optimization method and a computer programming method. The method was developed by **Richard Bellman** in the 1950s and has found applications in numerous fields, from aerospace engineering to economics. In both contexts it refers to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner. While some decision problems cannot be taken apart this way, decisions that span several points in time do often break apart recursively. Likewise, in computer science, if a problem can be solved optimally by breaking it into sub-problems and then recursively finding the optimal solutions to the sub-problems, then it is said to have optimal substructure.
+If sub-problems can be nested recursively inside larger problems, so that dynamic programming methods are applicable, then there is a relation between the value of the larger problem and the values of the sub-problems.[1] In the optimization literature this relationship is called the **Bellman equation**.
 
+[ Wikipedia ](https://en.wikipedia.org/wiki/Dynamic_programming)