
Introduction to the videos 0:02:25 
20170926 16:57:26 UTC 
0:02:25 
Introduction to the videos


Introduction to the course and algorithm complexity 0:49:06 
20170926 16:57:26 UTC 
0:49:06 
Introduction to the course and algorithm complexity


BigOh, Omega and Theta notation 0:48:19 
20170926 16:57:26 UTC 
0:48:19 
BigOh, Omega and Theta notation


Time analysis of Mergesort 0:49:57 
20170926 16:57:26 UTC 
0:49:57 
Time analysis of Mergesort


A more complex recurrence relation and counting inversions 0:52:48 
20170926 16:57:26 UTC 
0:52:48 
A more complex recurrence relation and counting inversions


Counting inversions; Fast integer multiplication 0:48:11 
20170926 16:57:26 UTC 
0:48:11 
Counting inversions; Fast integer multiplication


Fast integer multiplication, randomized selection and median finding 0:48:10 
20170926 16:57:26 UTC 
0:48:10 
Fast integer multiplication, randomized selection and median finding


More on randomized selection and median finding 0:52:13 
20170926 16:57:26 UTC 
0:52:13 
More on randomized selection and median finding


Expected number of comparisons in randomized select 0:50:10 
20170926 16:57:26 UTC 
0:50:10 
Expected number of comparisons in randomized select


Greedy algorithms: Picking largest set of nonoverlapping intervals 0:50:30 
20170926 16:57:26 UTC 
0:50:30 
Greedy algorithms: Picking largest set of nonoverlapping intervals


Greedy algorithms: The classroom scheduling problem 0:16:35 
20170926 16:57:26 UTC 
0:16:35 
Greedy algorithms: The classroom scheduling problem


Dijkstra's shortest path algorithm 0:51:41 
20170926 16:57:26 UTC 
0:51:41 
Dijkstra's shortest path algorithm


Start of minimum spanning tree problem 0:49:34 
20170926 16:57:26 UTC 
0:49:34 
Start of minimum spanning tree problem


Correctness of Kruskal's algorithm. 0:26:41 
20170926 16:57:26 UTC 
0:26:41 
Correctness of Kruskal's algorithm.


Recursive programming and memoization 0:47:37 
20170926 16:57:26 UTC 
0:47:37 
Recursive programming and memoization


Intro to dynamic programming, weighted interval problems 0:49:36 
20170926 16:57:26 UTC 
0:49:36 
Intro to dynamic programming, weighted interval problems


Intro to the RNA folding problem and recurrences 0:50:08 
20170926 16:57:26 UTC 
0:50:08 
Intro to the RNA folding problem and recurrences


Dynamic programming for RNA folding. 0:49:35 
20170926 16:57:26 UTC 
0:49:35 
Dynamic programming for RNA folding.


Dynamic programming for shortest path problem 0:37:29 
20170926 16:57:26 UTC 
0:37:29 
Dynamic programming for shortest path problem


FloydWarshall algorithm for allpairs shortest path 0:48:28 
20170926 16:57:26 UTC 
0:48:28 
FloydWarshall algorithm for allpairs shortest path


The uniquedecipherability problem 0:52:19 
20170926 16:57:26 UTC 
0:52:19 
The uniquedecipherability problem


UniqueDecipherability. Graph algorithm and proof of correctness 0:51:19 
20170926 16:57:26 UTC 
0:51:19 
UniqueDecipherability. Graph algorithm and proof of correctness


Lineartime pattern matching. Zvalues and Zalgorithm 0:51:45 
20170926 16:57:26 UTC 
0:51:45 
Lineartime pattern matching. Zvalues and Zalgorithm


Finish of lineartime pattern matching 0:51:35 
20170926 16:57:26 UTC 
0:51:35 
Finish of lineartime pattern matching


Introduction to approximation algorithms 0:47:51 
20170926 16:57:26 UTC 
0:47:51 
Introduction to approximation algorithms


Introduction to P and NP 0:50:07 
20170926 16:57:26 UTC 
0:50:07 


An intuitive view of NP 0:48:02 
20170926 16:57:26 UTC 
0:48:02 


Formal definition of P and NP 0:45:29 
20170926 16:57:26 UTC 
0:45:29 
Formal definition of P and NP


Major theorems of NPcompleteness 0:50:25 
20170926 16:57:26 UTC 
0:50:25 
Major theorems of NPcompleteness


Coping with NPcompleteness 0:39:36 
20170926 16:57:26 UTC 
0:39:36 
Coping with NPcompleteness


Introduction to the videos 0:02:25 
20171220 11:37:49 UTC 
0:02:25 
Introduction to the videos


Introduction to the course and algorithm complexity 0:49:06 
20171220 11:37:49 UTC 
0:49:06 
Introduction to the course and algorithm complexity


BigOh, Omega and Theta notation 0:48:19 
20171220 11:37:49 UTC 
0:48:19 
BigOh, Omega and Theta notation


Time analysis of Mergesort 0:49:57 
20171220 11:37:49 UTC 
0:49:57 
Time analysis of Mergesort


A more complex recurrence relation and counting inversions 0:52:48 
20171220 11:37:49 UTC 
0:52:48 
A more complex recurrence relation and counting inversions


Counting inversions; Fast integer multiplication 0:48:11 
20171220 11:37:49 UTC 
0:48:11 
Counting inversions; Fast integer multiplication


Fast integer multiplication, randomized selection and median finding 0:48:10 
20171220 11:37:49 UTC 
0:48:10 
Fast integer multiplication, randomized selection and median finding


More on randomized selection and median finding 0:52:13 
20171220 11:37:49 UTC 
0:52:13 
More on randomized selection and median finding


Expected number of comparisons in randomized select 0:50:10 
20171220 11:37:49 UTC 
0:50:10 
Expected number of comparisons in randomized select


Greedy algorithms: Picking largest set of nonoverlapping intervals 0:50:30 
20171220 11:37:49 UTC 
0:50:30 
Greedy algorithms: Picking largest set of nonoverlapping intervals


Greedy algorithms: The classroom scheduling problem 0:16:35 
20171220 11:37:49 UTC 
0:16:35 
Greedy algorithms: The classroom scheduling problem


Dijkstra's shortest path algorithm 0:51:41 
20171220 11:37:49 UTC 
0:51:41 
Dijkstra's shortest path algorithm


Start of minimum spanning tree problem 0:49:34 
20171220 11:37:49 UTC 
0:49:34 
Start of minimum spanning tree problem


Correctness of Kruskal's algorithm. 0:26:41 
20171220 11:37:49 UTC 
0:26:41 
Correctness of Kruskal's algorithm.


Recursive programming and memoization 0:47:37 
20171220 11:37:49 UTC 
0:47:37 
Recursive programming and memoization


Intro to dynamic programming, weighted interval problems 0:49:36 
20171220 11:37:49 UTC 
0:49:36 
Intro to dynamic programming, weighted interval problems


Intro to the RNA folding problem and recurrences 0:50:08 
20171220 11:37:49 UTC 
0:50:08 
Intro to the RNA folding problem and recurrences


Dynamic programming for RNA folding. 0:49:35 
20171220 11:37:49 UTC 
0:49:35 
Dynamic programming for RNA folding.


Dynamic programming for shortest path problem 0:37:29 
20171220 11:37:49 UTC 
0:37:29 
Dynamic programming for shortest path problem


FloydWarshall algorithm for allpairs shortest path 0:48:28 
20171220 11:37:49 UTC 
0:48:28 
FloydWarshall algorithm for allpairs shortest path


The uniquedecipherability problem 0:52:19 
20171220 11:37:49 UTC 
0:52:19 
The uniquedecipherability problem


UniqueDecipherability. Graph algorithm and proof of correctness 0:51:19 
20171220 11:37:49 UTC 
0:51:19 
UniqueDecipherability. Graph algorithm and proof of correctness


Lineartime pattern matching. Zvalues and Zalgorithm 0:51:45 
20171220 11:37:49 UTC 
0:51:45 
Lineartime pattern matching. Zvalues and Zalgorithm


Finish of lineartime pattern matching 0:51:35 
20171220 11:37:50 UTC 
0:51:35 
Finish of lineartime pattern matching


Introduction to approximation algorithms 0:47:51 
20171220 11:37:50 UTC 
0:47:51 
Introduction to approximation algorithms


Introduction to P and NP 0:50:07 
20171220 11:37:50 UTC 
0:50:07 


An intuitive view of NP 0:48:02 
20171220 11:37:50 UTC 
0:48:02 


Formal definition of P and NP 0:45:29 
20171220 11:37:50 UTC 
0:45:29 
Formal definition of P and NP


Major theorems of NPcompleteness 0:50:25 
20171220 11:37:50 UTC 
0:50:25 
Major theorems of NPcompleteness


Coping with NPcompleteness 0:39:36 
20171220 11:37:50 UTC 
0:39:36 
Coping with NPcompleteness
