sorting algorithms, recurrence relations, divide and conquer algorithms, greedy algorithms, dynamic programming, linear programming, graph algorithms, problems in P and NP, and approximation ...

Developing algorithmic thinking. Basic toolkit for the design and analysis of algorithms: Running time, Recurrence relations, Big-O notation, Correctness, Finite induction, Loop invariants. Tour of ...