Algorithms, data structures, and their analysis.

I am a professor at San Jose State University. There are a lot of freaking David Taylors out there, even a handful if you limit it only to computer scientists, so I go by David Scot Taylor.

Recurrence Relations: Master Method
15:40
Recurrence Relations: Master Method
Recurrence Relations: Three Examples
7:11
Recurrence Relations: Three Examples
Floyd-Warshall All-Pairs Shortest Paths: A Dynamic Programming Approach
15:17
Floyd-Warshall All-Pairs Shortest Paths: A Dynamic Programming Approach
Dynamic Programming: Subset Sum
26:46
Dynamic Programming: Subset Sum
Disjoint Sets: the Union-Find Data Structure
13:33
Disjoint Sets: the Union-Find Data Structure
Introduction to Dynamic Programming: Fibonacci Numbers
9:05
Introduction to Dynamic Programming: Fibonacci Numbers
Introduction to P and NP: The Clique Problem
8:19
Introduction to P and NP: The Clique Problem
Boruvka's Minimum Spanning Tree Algorithm
4:52
Boruvka's Minimum Spanning Tree Algorithm
NP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating Set
13:23
NP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating Set
Dynamic Programming: the Rod Cutting Problem
9:59
Dynamic Programming: the Rod Cutting Problem
Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)
9:50
Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)
Kruskal's Minimum Spanning Tree Algorithm
5:48
Kruskal's Minimum Spanning Tree Algorithm
Introduction to Minimum Spanning Trees
8:59
Introduction to Minimum Spanning Trees
Linear Time Sorting: Counting Sort, Radix Sort, and Bucket Sort
19:45
Linear Time Sorting: Counting Sort, Radix Sort, and Bucket Sort
Lower Bounds for Comparison Based Sorting: Decision Trees
10:52
Lower Bounds for Comparison Based Sorting: Decision Trees
Runtime Analysis for Quick Sort and Quick Select
10:00
Runtime Analysis for Quick Sort and Quick Select
Kosaraju's Algorithm for Strongly Connected Components
17:46
Kosaraju's Algorithm for Strongly Connected Components
Depth First Search Based Topological Sort
7:48
Depth First Search Based Topological Sort
Kahn's Algorithm for Topological Sorting
11:19
Kahn's Algorithm for Topological Sorting
Merge Sort: Top-Down and Bottom-Up
20:19
Merge Sort: Top-Down and Bottom-Up
Quick Sort and Quick Select
21:36
Quick Sort and Quick Select
You're Not a Freakin' Moron (The Imposter Syndrome)
1:20
You're Not a Freakin' Moron (The Imposter Syndrome)
Geometric Series for Algorithms Analysis
3:17
Geometric Series for Algorithms Analysis
Introduction to Topological Sorting in Directed Acyclic Graphs
2:40
Introduction to Topological Sorting in Directed Acyclic Graphs
Graphs: Depth First Search (DFS) with Example
12:34
Graphs: Depth First Search (DFS) with Example
Directed Acyclic Graph (DAG) Single Source Shortest Paths with Example
7:10
Directed Acyclic Graph (DAG) Single Source Shortest Paths with Example
Dijkstra's Single Source Shortest Paths Algorithm with Example
12:08
Dijkstra's Single Source Shortest Paths Algorithm with Example
Bellman Ford Single Source Shortest Paths Algorithm with Example
10:34
Bellman Ford Single Source Shortest Paths Algorithm with Example
Introduction to Single Source Shortest Paths
8:58
Introduction to Single Source Shortest Paths
Graphs: Breadth First Search (BFS) with Example
7:19
Graphs: Breadth First Search (BFS) with Example