including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy algorithms, dynamic programming, linear programming, graph algorithms, problems in ...

Algorithm design strategies such as divide and conquer. Elementary techniques for ... with an emphasis on establishing algorithmic correctness and estimating time and space complexity.