The original comb sort is vulnerable to seriously degraded performance with certain repetitive input sequences. This variation addresses those problems and bounds worst case performance. http://world.std.com/~jdveale/combsort.htm
A Java implementation of the Wealthy Adaptative Search Algorithm, a constraint-solving algorithm using a stochastic approach. Sourceforge/GPL. http://wasa.sourceforge.net/
Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online demos and efficient implementations. http://www.levenshtein.net