06:59

Stack - Unit Tests

06:50

Stack - Setup

05:01

Google Test

03:02

CMake

01:41

Data Structures in C++ - Setup

00:36

Data Structures in C++ - Intro

09:13

Red Black Tree - Part 0

10:47

Big Omega Notation - Part 2

10:25

Big Oh Notation - Part 2

08:23

Dijkstra's Shortest Path

15:41

Minimum Spanning Tree - Prim's Algorithm

04:42

Minimum Spanning Tree - Kruskal's Algorithm

13:18

Disjoint Sets - Union Operation

12:16

Graphs Adjacency Lists and Matrices

08:29

Graphs - Breadth First Search

06:25

Graphs - Depth First Search

13:47

Dynamic Programming - Longest Common Subsequence

13:16

Dynamic Programming - Optimizing Matrix Multiplication

13:59

Red Black Tree - Part 1

09:36

Decision Tree

10:00

Master Method

11:40

Mathematical Induction - Part 2

16:45

Recursion Tree - Uneven

04:04

Mathematical Induction - Part 1

13:52

(NOT) Linear Time Selection Algorithm (using n/3)

06:10

Heap - Build Max Heap

06:24

Heap - Max Heapify

11:51

Recursion Tree - Even

18:55

Time Complexity - Part 2

13:32

Time Complexity - Part 1

07:21

Merge Sort - Part 2

09:18

Merge Sort - Part 1

06:57

Merge Sort - Idea

16:14

Insertion Sort - Running Time - Part 2

09:52

Insertion Sort - Running Time - Part 1

06:54

Insertion Sort

05:48

Big Theta Notation

05:33

Insertion Sort - Idea

04:36

Big Omega Notation

04:02

Big-Oh Notation

02:10

Overview

17:23

Performance

06:22

Single Cycle Datapath Overview

06:11

Datapath Control I - Type

12:33

Recursion

01:48

Datapath Control J - Type

04:40

Datapath Control R - Type

02:00

Nerf Trauma