It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

MG4C6.1 Foundations of Mathematical Programming: An introduction to linear programming and to the theory of duality. MG4C6.2 Mathematical Programming: Introduction to theory and the solution of linear ...

Introduction to theory of algorithms guided by basic Python programming. Algorithmic thinking: Do you know how to multiply integers? Basic toolkit for the design and analysis of algorithms, and an ...

This is a graduate course on algorithms. We will focus on studying basic algorithms at a finer level of detail and more advanced algorithms and data structures “Concrete” Mathematics: Solving ...