Этап 1

Introduction to the videos

Этап 2

Introduction to the course and algorithm complexity

Этап 3

Big-Oh, Omega and Theta notation

Этап 4

Time analysis of Mergesort

Этап 5

A more complex recurrence relation and counting inversions

Этап 6

Counting inversions; Fast integer multiplication

Этап 7

Fast integer multiplication, randomized selection and median finding

Этап 8

More on randomized selection and median finding

Этап 9

Expected number of comparisons in randomized select

Этап 10

Greedy algorithms: Picking largest set of non-overlapping intervals

Этап 11

Greedy algorithms: The classroom scheduling problem

Этап 12

Dijkstra's shortest path algorithm

Этап 13

Start of minimum spanning tree problem

Этап 14

Correctness of Kruskal's algorithm.

Этап 15

Recursive programming and memoization

Этап 16

Intro to dynamic programming, weighted interval problems

Этап 17

Intro to the RNA folding problem and recurrences

Этап 18

Dynamic programming for RNA folding.

Этап 19

Dynamic programming for shortest path problem

Этап 20

Floyd-Warshall algorithm for all-pairs shortest path

Этап 21

The unique-decipherability problem

Этап 22

Unique-Decipherability. Graph algorithm and proof of correctness

Этап 23

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

Этап 24

Finish of linear-time pattern matching

Этап 25

Introduction to approximation algorithms

Этап 26

Introduction to P and NP

Этап 27

An intuitive view of NP

Этап 28

Formal definition of P and NP

Этап 29

Major theorems of NP-completeness

Этап 30

Coping with NP-completeness