Chapter 1 - Introduction

• Euclids Algorithm (gcd)
• Sieve of Eratosthenes (primes)

Chapter 2 - Algorithm Efficiency

• Counting binary digits
• Tower of Hanoi
• Restricted Tower of Hanoi
• Cyclic Tower of Hanoi
• Fibonacci Game

Chapter 3 - Brute Force and Exhaustive Search

• Selection Sort
• Bubble Sort
• String Matching
• Closest-Pair
• Convex-Hull
• Travelling Salesman Problem
• Knapsack Problem
• Assignment Problem

Chapter 4 - Decrease-and-Conquer

• Insertion Sort
• Shellsort
• Topological Sorting (DFS)
• Topological Sorting (Source-Removal)
• Binary Search
• Fake Coin Problem - CS & JH
• Russian Peasant Multiplication
• Josephus - External Video
• Hoare Partitioning
• Lomuto Partitioning
• QuickSelect
• Interpolation Search
• Game of Nim

Chapter 5 - Divide-and-Conquer

Chapter 6 - Transform-and-Conquer

• Gaussian Elimination
• AVL tress - external link
• Heap Sort - external link

Intro Video

Chapter 7 - Space and Time Trade-Offs

• Horsepool
• Boyer Moore
• B tress - external link
• B+ tress - external link

Chapter 8 - Dynamic Programming

• Knapsack
• Optimal Binary Search Tree
• Warshalls Algorithm
• Floyds Algorithm

Chapter 9 - Greedy Technique

• Prim’s MST algorithm - Video
• Kruskal’s MST algorithm - Video
• Union-Find
• Union-Find Random Maze
• Dijkstra
• Huffman encoding

Chapter 10 - Iterative Improvement

• Simplex
• Video
• Max Flow - Needs work
• Max Flow - Video Needs work
• Maximum Matching in Byparttite Graphs

Chapter 11 - Limitations of Algorithm Power

Chapter 12 - Coping with the Limitations

Extra

• Sorting animations - external link