[20/7/2015] - Introduction
[21/7/2015] - Binary Search Trees
[23/7/2015] - Basic Principles of Algorithm Design
[27/7/2015],[28/7/2015],[30/7/2015] - Maximum Subarray Sum
[3/8/2015],[4/8/2015],[6/8/2015] - Model of Computation and Comparison of Algorithms
[10/8/2015] - Maximum Subarray Sum, Counting Inversion Pairs
[11/8/2015] - Integer Multiplication
[13/8/2015] - Finding the Median
No classes were held.
[24/8/2015] - Finding the Median
[25/8/2015] - Introduction to Dynamic Programming
[31/8/2015] - Finding the closest pair
[3/9/2015] - Weighted Interval Scheduling
[14/9/2015] - Weighted Interval Scheduling
[16/9/2015] - Array Partitioning Problems
[21/9/2015] - Problems on trees
[22/9/2015] - Knapsack
[24/9/2015] - Shortest Paths