15:40

Recurrence Relations: Master Method

07:11

Recurrence Relations: Three Examples

15:17

Floyd-Warshall All-Pairs Shortest Paths: A Dynamic Programming Approach

26:46

Dynamic Programming: Subset Sum

13:33

Disjoint Sets: the Union-Find Data Structure

09:05

Introduction to Dynamic Programming: Fibonacci Numbers

08:19

Introduction to P and NP: The Clique Problem

04:52

Boruvka's Minimum Spanning Tree Algorithm

13:23

NP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating Set

09:59

Dynamic Programming: the Rod Cutting Problem

09:50

Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)

05:48

Kruskal's Minimum Spanning Tree Algorithm

08:59

Introduction to Minimum Spanning Trees

19:45

Linear Time Sorting: Counting Sort, Radix Sort, and Bucket Sort

10:52

Lower Bounds for Comparison Based Sorting: Decision Trees

10:00

Runtime Analysis for Quick Sort and Quick Select

17:46

Kosaraju's Algorithm for Strongly Connected Components

07:48

Depth First Search Based Topological Sort

11:19

Kahn's Algorithm for Topological Sorting

20:19

Merge Sort: Top-Down and Bottom-Up

21:36

Quick Sort and Quick Select

01:20

You're Not a Freakin' Moron (The Imposter Syndrome)

03:17

Geometric Series for Algorithms Analysis

02:40

Introduction to Topological Sorting in Directed Acyclic Graphs

12:34

Graphs: Depth First Search (DFS) with Example

07:10

Directed Acyclic Graph (DAG) Single Source Shortest Paths with Example

12:08

Dijkstra's Single Source Shortest Paths Algorithm with Example

10:34

Bellman Ford Single Source Shortest Paths Algorithm with Example

08:58

Introduction to Single Source Shortest Paths

07:19

Graphs: Breadth First Search (BFS) with Example

08:53

Graphs: Representation

07:43

Introduction to Graphs

08:06

Linked Lists and Dynamic Arrays: Misuse and Abuse

06:18

Stacks, Queues, and Double Ended Queues (Deques)

10:05

Advanced Dynamic Arrays

10:11

Dynamic Arrays, aka ArrayLists

03:13

Lists, Iterators, and Abstract Data Types

11:58

Linked Lists

05:40

Recurrence Relations: Recursion Tree Method

08:27

Recurrence Relations: Substitution Method

04:57

Recurrence Relations and Recursion

07:13

Asymptotic Notation: Runtime of Simple Programs And Loops

03:23

Asymptotic Notation: Usage

05:14

Asymptotic Notation: Proofs, Properties, and Pictures

01:08

Introduction for Students

05:32

Iterated Functions and log*

12:21

Asymptotic Notation: Definitions

04:52

Optimized Heapify

00:17

New Channel Teaser

06:03

Binary Heaps for Priority Queues

03:32

Heap Sort

09:47

Introduction to Binary Heaps (MaxHeaps)

05:20

Linear Time BuildHeap