Algorithms with Attitude
Recurrence Relations: Master Method
15:40
Algorithms with Attitude
Recurrence Relations: Three Examples
7:11
Algorithms with Attitude
Floyd-Warshall All-Pairs Shortest Paths: A Dynamic Programming Approach
15:17
Algorithms with Attitude
Dynamic Programming: Subset Sum
26:46
Algorithms with Attitude
Disjoint Sets: the Union-Find Data Structure
13:33
Algorithms with Attitude
Introduction to Dynamic Programming: Fibonacci Numbers
9:05
Algorithms with Attitude
Introduction to P and NP: The Clique Problem
8:19
Algorithms with Attitude
Boruvka's Minimum Spanning Tree Algorithm
4:52
Algorithms with Attitude
NP-Complete Reductions: Clique, Independent Set, Vertex Cover, and Dominating Set
13:23
Algorithms with Attitude
Dynamic Programming: the Rod Cutting Problem
9:59
Algorithms with Attitude
Prim's Minimum Spanning Tree Algorithm (Jarnik's Algorithm)
9:50
Algorithms with Attitude
Kruskal's Minimum Spanning Tree Algorithm
5:48
Algorithms with Attitude
Introduction to Minimum Spanning Trees
8:59
Algorithms with Attitude
Linear Time Sorting: Counting Sort, Radix Sort, and Bucket Sort
19:45
Algorithms with Attitude
Lower Bounds for Comparison Based Sorting: Decision Trees
10:52
Algorithms with Attitude
Runtime Analysis for Quick Sort and Quick Select
10:00
Algorithms with Attitude
Kosaraju's Algorithm for Strongly Connected Components
17:46
Algorithms with Attitude
Depth First Search Based Topological Sort
7:48
Algorithms with Attitude
Kahn's Algorithm for Topological Sorting
11:19
Algorithms with Attitude
Merge Sort: Top-Down and Bottom-Up
20:19
Algorithms with Attitude
Quick Sort and Quick Select
21:36
Algorithms with Attitude
You're Not a Freakin' Moron (The Imposter Syndrome)
1:20
Algorithms with Attitude
Geometric Series for Algorithms Analysis
3:17
Algorithms with Attitude
Introduction to Topological Sorting in Directed Acyclic Graphs
2:40
Algorithms with Attitude
Graphs: Depth First Search (DFS) with Example
12:34
Algorithms with Attitude
Directed Acyclic Graph (DAG) Single Source Shortest Paths with Example
7:10
Algorithms with Attitude
Dijkstra's Single Source Shortest Paths Algorithm with Example
12:08
Algorithms with Attitude
Bellman Ford Single Source Shortest Paths Algorithm with Example
10:35
Algorithms with Attitude
Introduction to Single Source Shortest Paths
8:58
Algorithms with Attitude
Graphs: Breadth First Search (BFS) with Example
7:19
Algorithms with Attitude
Graphs: Representation
8:53
Algorithms with Attitude
Introduction to Graphs
7:43
Algorithms with Attitude
Linked Lists and Dynamic Arrays: Misuse and Abuse
8:06
Algorithms with Attitude
Stacks, Queues, and Double Ended Queues (Deques)
6:18
Algorithms with Attitude
Advanced Dynamic Arrays
10:05
Algorithms with Attitude
Dynamic Arrays, aka ArrayLists
10:11
Algorithms with Attitude
Lists, Iterators, and Abstract Data Types
3:13
Algorithms with Attitude
Linked Lists
11:58
Algorithms with Attitude
Recurrence Relations: Recursion Tree Method
5:40
Algorithms with Attitude
Recurrence Relations: Substitution Method
8:27
Algorithms with Attitude
Recurrence Relations and Recursion
4:57
Algorithms with Attitude
Asymptotic Notation: Runtime of Simple Programs And Loops
7:13
Algorithms with Attitude
Asymptotic Notation: Usage
3:23
Algorithms with Attitude
Asymptotic Notation: Proofs, Properties, and Pictures
5:14
Algorithms with Attitude
Introduction for Students
1:08
Algorithms with Attitude
Iterated Functions and log*
5:32
Algorithms with Attitude
Asymptotic Notation: Definitions
12:21
Algorithms with Attitude
Optimized Heapify
4:52
Algorithms with Attitude
New Channel Teaser
0:17
Algorithms with Attitude
Binary Heaps for Priority Queues
6:03
Algorithms with Attitude
Linear Time BuildHeap
5:20
Algorithms with Attitude
Introduction to Binary Heaps (MaxHeaps)
9:47
Algorithms with Attitude
Heap Sort
3:32