31251 Lec 13.1 Intro to Dynamic Programming

(13:5)

31251 Lec 2.5: Deque

(12:24)

31251 Lec 4.5: Insertion Sort

(12:50)

31251 Lec 4.1: Intro to the Analysis of Algorithms

(7:7)

31251 Lec 6.1: Hash Tables

(23:23)

31251 Lec 10.2: A generic shortest path algorithm

(16:16)

31251 Lec 5.4: Mergesort

(11:13)

31251 Lec 2.1: Abstract Data Types

(6:48)

31251 Lec 2.3: Resizable Arrays

(17:16)

31251 Lec 9.4: Breadth-first search

(12:42)

31251 Lec 2.4: Linked Lists

(23:31)

31251 Lec 5.5: Mergesort example

(7:46)

31251 Lec 3.1: Introduction to templates in C++

(9:54)

31251 Lec 2.2: Fixed-Size Arrays

(6:20)

31251 Lec 6.3: Stack

(5:44)

31251 Lec 1.4: Tests and Loops

(6:35)

31251 Lec 4.4: Introduction to Sorting

(6:19)

31251 Lec 11.1: Job scheduling and topological sort

(11:54)

31251 Lec 1.7: References

(3:46)

31251 Lec 1.2: C++ built-in types

(3:5)