lectures.alex.balgavy.eu

Lecture notes from university.
git clone git://git.alex.balgavy.eu/lectures.alex.balgavy.eu.git
Log | Files | Refs | Submodules

dynamic-programming.md (415B)

      1 +++
      2 title = "Dynamic Programming"
      3 +++
      4 
      5 Dynamic programming is a way to optimise algorithms by reducing the amount of computation being done.
      6 DP algorithms store previous results and reuse them when calculating.
      7 
      8 
      9 - [Fibonacci numbers](../fibonacci-numbers)
     10 - [Max subarray](../max-subarray)
     11 - [Knapsack01](../knapsack01)
     12 - [Rod cutting](../rod-cutting)
     13 - [Longest common subsequence](../longest-common-subsequence)