CS 4040/5040: Design and Analysis of Algorithms

Spring 2020

This course provides an introduction to the modern study of computer algorithms. Through this course students should be able to:

** Course materials**^{1}**:**

- Syllabus & Introduction
- Mathematical background
- Insertion Sort: proof of correctness
- Asymptotic analysis
- Merge Sort: analysis of time complexity
- Master Theorem
- Heapsort and Priority Queues
- Quicksort
- Comparison Sort: lower bound
- Count & Radix Sort
- Selection
- Matrix Multiplication; Closest Pair
- Hand notes Selection and Strassen and Closest Pair

- Minimum Spanning Trees