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) .

View on Coursera Course Decription This course introduces number-theory based cryptography, basics of quantum algorithms and advanced data-structures. Learning Outcomes Understand how basic ...

This note describes a basic algorithm developed by the IMF to balance supply and use tables automatically, allowing a much faster SUT balancing process. For training purposes, this algorithm has been ...