Course Slides/notes:
Syllabus
Introduction
Asymptotic Analysis 1
Asymptotic Analysis 2
Homework 1
;
Homework 1 Solution
Insertion Sort, Merge Sort, and Master Theorem
Proof of Master Theorem
Heap
;
Linear time complexity for building a heap (proof)
Homework 2
;
Homework 2 Solution
BST, AVL-Tree
Hashing
Homework 3
;
Homework 3 Solution
Graph
Midterm review
;
Practice problems
;
Midterm Solution
Minimum Spanning Tree, Greedy Algorithms
;
correctness_for_MST
Homework 4
;
Homework 4 Solution
Homework 5
;
Homework 5 Solution
Shortest Path
Dynamic Programming
Homework 6
Homework 6 (Problem 5 and 6) Solution
Homework 6 (Problem 1 to 4) Solution
Approximation Algorithms