Analysis of Algorithms Lectures

Introduction to mathematical analysis of a variety of computer algorithms including searching, sorting, matrix multiplication, fast Fourier transform, and graph algorithms. Time and space complexity. Upper-bound, lower- bound, and average-case analysis. Introduction to NP completeness. Some machine computation is required for the implementation and comparison of algorithms.

Below are the YouTube video links and lecture slides for both my Fall 2020 Zoom Analysis of Algorithms (CSE 373) course and my Fall 2016 pre-COVID, in-class lectures. YouTube provides closed caption subtitles for these lectures, which you can enable by clicking on the CC button on the bottom of the video.

My lectures are based on my book The Algorithm Design Manual. Links to my past video and lecture slides can be found here.