Step 1

Introduction to the videos

Step 2

Introduction to the course and algorithm complexity

Step 3

Big-Oh, Omega and Theta notation

Step 4

Time analysis of Mergesort

Step 5

A more complex recurrence relation and counting inversions

Step 6

Counting inversions; Fast integer multiplication

Step 7

Fast integer multiplication, randomized selection and median finding

Step 8

More on randomized selection and median finding

Step 9

Expected number of comparisons in randomized select

Step 10

Greedy algorithms: Picking largest set of non-overlapping intervals

Step 11

Greedy algorithms: The classroom scheduling problem

Step 12

Dijkstra's shortest path algorithm

Step 13

Start of minimum spanning tree problem

Step 14

Correctness of Kruskal's algorithm.

Step 15

Recursive programming and memoization

Step 16

Intro to dynamic programming, weighted interval problems

Step 17

Intro to the RNA folding problem and recurrences

Step 18

Dynamic programming for RNA folding.

Step 19

Dynamic programming for shortest path problem

Step 20

Floyd-Warshall algorithm for all-pairs shortest path

Step 21

The unique-decipherability problem

Step 22

Unique-Decipherability. Graph algorithm and proof of correctness

Step 23

Linear-time pattern matching. Z-values and Z-algorithm

Step 24

Finish of linear-time pattern matching

Step 25

Introduction to approximation algorithms

Step 26

Introduction to P and NP

Step 27

An intuitive view of NP

Step 28

Formal definition of P and NP

Step 29

Major theorems of NP-completeness

Step 30

Coping with NP-completeness