Етап 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