It is easy to see how a program flows. For example, where does following one path, as opposed to another, take the program? Flowcharts follow an international standard - it is easy for any flowchart ...

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