Chapter 1

Searching and Sorting

Binary search

medium • 1 min read

Insertion sort

medium • 2 min read

Selection sort

medium • 3 min read

Merge sort

medium • 4 min read

Quick sort

medium • 5 min read

Chapter 2

Asymptotic Analysis

Big-O notation

medium • 1 min read

Omega notation

medium • 2 min read

Theta notation

medium • 3 min read

Master theorem

medium • 4 min read

Recurrence solving

medium • 5 min read

Chapter 3

Design Techniques

Greedy algorithms

medium • 1 min read

Dynamic programming

medium • 2 min read

Divide and conquer

medium • 3 min read

Backtracking

medium • 4 min read

Branch and bound

medium • 5 min read

Chapter 4

Graph Algorithms

Shortest paths

medium • 1 min read

Dijkstra's algorithm

medium • 2 min read

Bellman-Ford

medium • 3 min read

Minimum spanning trees

medium • 4 min read

Prim's and Kruskal's

medium • 5 min read

Chapter 5

Flow Networks

Max-flow min-cut

medium • 1 min read

Ford-Fulkerson

medium • 2 min read

Bipartite matching

medium • 3 min read

Capacitated networks

medium • 4 min read

Residual graphs

medium • 5 min read

Chapter 6

Computational Complexity

P and NP classes

medium • 1 min read

NP-completeness

medium • 2 min read

NP-hardness

medium • 3 min read

Polynomial time reduction

medium • 4 min read

Cook's theorem

medium • 5 min read

Chapter 7

Approximation Algorithms

Vertex cover

medium • 1 min read

TSP approximation

medium • 2 min read

Greedy set cover

medium • 3 min read

Knapsack approximation

medium • 4 min read

Local search

medium • 5 min read

Chapter 8

Randomized Algorithms

Quick sort randomization

medium • 1 min read

Las Vegas vs Monte Carlo

medium • 2 min read

Min-cut probability

medium • 3 min read

Skip lists

medium • 4 min read

Random walk

medium • 5 min read