Etapa 1

Introduction to the videos

Etapa 2

Introduction to the course and algorithm complexity

Etapa 3

Big-Oh, Omega and Theta notation

Etapa 4

Time analysis of Mergesort

Etapa 5

A more complex recurrence relation and counting inversions

Etapa 6

Counting inversions; Fast integer multiplication

Etapa 7

Fast integer multiplication, randomized selection and median finding

Etapa 8

More on randomized selection and median finding

Etapa 9

Expected number of comparisons in randomized select

Etapa 10

Greedy algorithms: Picking largest set of non-overlapping intervals

Etapa 11

Greedy algorithms: The classroom scheduling problem

Etapa 12

Dijkstra's shortest path algorithm

Etapa 13

Start of minimum spanning tree problem

Etapa 14

Correctness of Kruskal's algorithm.

Etapa 15

Recursive programming and memoization

Etapa 16

Intro to dynamic programming, weighted interval problems

Etapa 17

Intro to the RNA folding problem and recurrences

Etapa 18

Dynamic programming for RNA folding.

Etapa 19

Dynamic programming for shortest path problem

Etapa 20

Floyd-Warshall algorithm for all-pairs shortest path

Etapa 21

The unique-decipherability problem

Etapa 22

Unique-Decipherability. Graph algorithm and proof of correctness

Etapa 23

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

Etapa 24

Finish of linear-time pattern matching

Etapa 25

Introduction to approximation algorithms

Etapa 26

Introduction to P and NP

Etapa 27

An intuitive view of NP

Etapa 28

Formal definition of P and NP

Etapa 29

Major theorems of NP-completeness

Etapa 30

Coping with NP-completeness