Hello,

some time ago I've been interested in highly optimized text search
algorithms and wrote some in assembler.

A very good analysis of text search algorithms can be found in the
8/97 issue of the German magazin C't (www.heise.de/ct) - "Blitzfindig"
by Michael Tamm.
This article compares the algoritms "Brute Force" "Boyer-Moore",
"Quicksearch" and the advanced "T-Search" in detail.

The C source can be found on: ftp://ftp.heise.de/pub/ct/listings/ct9708.zip
Have fun...

MfG,
  Stephan Tolksdorf