Hashing 

Dynamic Programming

** Polynomial-time Reductions **

** Polynomial-time Reductions **

Elementary Graph Algorithms

Topological Sort,
    Strongly Connected Components,
    Biconnected Components & Articulation Points

The Shortest Path Problem

Bellman-Ford and Dijkstra's algorithms for single-source
    shortest path

Floyd-Warshall algorithm for all-pair shortest path

Maximum Flow & Minimum Cut

Prescheduled lectures moved to W17.

** No lecture this week ** 

*** Final Exam ***

Minimum Spanning Tree

Prim's algorithm

Amortized Analysis

String Algorithms

NP-Completeness and Reductions

Comparison-Based Sorting Algorithms

Sorting in O(n^2) and O(n log n) time

Asymptotic Notations

More on Sorting Algorithms

Ω(n log n)-Time Lower-bound
    for Comparison-based sorting algorithms,

Sorting Algorithms in O(n) time.

Solving Recurrences

** Program Assignment I - an introduction ** 

Binary Search

Divide-and-Conquer 

Fast Fourier Transform (FFT)

Median & k-th Order Selection

Balanced Binary Tree Structures 

Heap and HeapSort
    Segment Tree

(Balanced) Binary Search Trees (BSTs)

Treap, Red-Black Tree