Fast Algorithms for Sorting and Searching Strings - The original paper and examples by Jon Bentley and Robert Sedgewick.

Description of sorting algorithms with examples

Overview of algorithms to find the median in a list of values; implementations and links are also provided.

Collection of algorithms for sorting and searching from arrays to B-Trees - theory, examples, implementation.

Overview of many sorting techniques and corresponding links.

Article describing and discussing the SoundEx searching algorithm and enhancements to make it more accurate. Includes SoundEx conversion form and Open licensed source code in C, JavaScript, and Perl.

Sorting by in place permutation with time complexity O(n) using an auxiliary vector. Papers, animations and implementations.

ANSI C implementation of E. Ukkonen's algorithm that makes it convenient to do string matching against a data set in O(N) time. Includes source code, an interface in Perl, and a write-up.

Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online demos and efficient implementations.

Fast String Searching With Suffix Trees by Mark Nelson