Algorithms with Attitude

Linear Time BuildHeap

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

Stacks, Queues, and Double Ended Queues (Deques)

Introduction to Dynamic Programming: Fibonacci Numbers

Linear Time BuildHeap

Linked Lists and Dynamic Arrays: Misuse and Abuse

Graphs: Representation

Asymptotic Notation: Definitions

Heap Sort

Advanced Dynamic Arrays

Binary Heaps for Priority Queues

Dynamic Arrays, aka ArrayLists

Recurrence Relations: Substitution Method

Asymptotic Notation: Runtime of Simple Programs And Loops

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

Lower Bounds for Comparison Based Sorting: Decision Trees

Dynamic Programming: the Rod Cutting Problem

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

Introduction to P and NP: The Clique Problem

Boruvka's Minimum Spanning Tree Algorithm

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

Kahn's Algorithm for Topological Sorting

Kosaraju's Algorithm for Strongly Connected Components

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

Recurrence Relations: Three Examples

Geometric Series for Algorithms Analysis

Depth First Search Based Topological Sort

Runtime Analysis for Quick Sort and Quick Select

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

Kruskal's Minimum Spanning Tree Algorithm

Disjoint Sets: the Union-Find Data Structure

Introduction to Minimum Spanning Trees

Recurrence Relations: Master Method

Introduction to Topological Sorting in Directed Acyclic Graphs

Dynamic Programming: Subset Sum

Quick Sort and Quick Select