Create divide and conquer, dynamic programming, and greedy algorithms. Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems.

Dynamic programming provides a road map at each point in time for optimal spending and asset allocation, which have been determined by first considering optimal future behavior stemming from today ...