Approximate Solutions of Hard Problems

1. A compendium of NP optimization problems

Randomized Algorithms

1. Quicksort
   1. The Wikipedia page, with a nice animation of quicksort running
2. The mathematic basis for randomized primality testing
   1. Mathworld’s page on Fermat’s Little Theorem
   2. Julio Gonzalez Cabillon’s page on Fermat’s Little Theorem, including a biography of Robert Carmichael
   3. MathWorld’s page on Carmichael numbers
3. Efficient primality testing
   1. The Mersennewiki page on primality testing
   2. Techniques for using known primality results
   3. An applet that let’s you try the Miller-Rabin test

Heuristic Search

1. Heuristics
2. A* algorithm
   1. Justin Heyes-Jones’s A* tutorial and download
3. Puzzles that can be used to experiment with search algorithms
   1. Plastelina(only works in Internet Explorer)
   2. Cryptarithmetic