This course explains how to analyze algorithm efficiency using time complexity, asymptotic analysis, recurrence methods, probabilistic analysis, and amortized analysis. It applies these techniques to sorting algorithms, heaps, hashtables, and binary search trees.

Syllabus

⌨️ 0:00:00 Course overview
⌨️ 0:03:00 Introduction to time complexity
⌨️ 0:20:21 Time complexity analysis of insertion sort
⌨️ 0:41:35 Asymptotic analysis
⌨️ 1:16:32 Divide and conquer - Recurrence tree method
⌨️ 1:43:55 Divide and conquer - Master theorem
⌨️ 2:13:54 Probabilistic analysis - Quicksort
⌨️ 2:34:51 Probabilistic analysis - Average case and expected value
⌨️ 3:08:31 Heaps and heapsort
⌨️ 4:11:47 Hashtables
⌨️ 4:50:55 Binary search trees
⌨️ 5:42:50 Amortized analysis