Closely related to stochastic programming and dynamic programming, stochastic dynamic programming represents the problem under scrutiny in the form of a Bellman equation. Originally introduced by Richard E. Bellman in (Bellman 1957), stochastic dynamic programming is a technique for modelling and solve problems of decision make under uncertainty.

COMING SOON!

```
package Mathematics
object FindMin {
/**
* Method returns Minimum Element from the list
*
* @param listOfElements
* @return
*/
def findMin(elements : List[Int]): Int = elements.foldLeft(elements.head){(acc, i) => if (acc < i) acc else i}
}
```