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 video and lecture slides for my
Fall 2016 Analysis of Algorithms (CSE 373) course.

For best viewing quality, use Echo360. My video lectures are also closed-captioned on YouTube. You can enable the subtitles by clicking on the CC button on the bottom of the video.

Links to my past video and lecture slides can be found here

If you found this useful also check out the video lectures of my Discrete Mathematics, Computational Biology, Computational Finance, and Data Science courses.