31251 Lec 2.1: Abstract Data Types

(6:48)

31251 Lec 2.5: Deque

(12:24)

31251 Lec 1.7: References

(3:46)

31251 Lec 5.1: Binary Search

(15:13)

31251 Lec 9.4: Breadth-first search

(12:42)

31251 Lec 1.4: Tests and Loops

(6:35)

31251 Lec 1.6: Pointer basics

(16:50)

31251 Lec 13.1 Intro to Dynamic Programming

(13:5)

31251 Lec 6.4: Queue

(2:42)

31251 Lec 1.2: C++ built-in types

(3:5)

31251 Lec 4.8: Radix Sort

(7:58)

31251 Lec 4.4: Introduction to Sorting

(6:19)

31251 Lec 4.5: Insertion Sort

(12:50)

31251 Lec 1.5: Compiling with Warnings

(4:11)

31251 Lec 4.1: Intro to the Analysis of Algorithms

(7:7)

31251 Lec 4.6: Properties of Insertion Sort

(5:48)

31251 Lec 11.2: Detecting a Directed Cycle

(20:46)

31251 Lec 11.1: Job scheduling and topological sort

(11:54)

31251 Lec 5.4: Mergesort

(11:13)

31251 Lec 6.3: Stack

(5:44)