| Home :: Algorithms :: Sorting and Searching |
Sequitur Infers a hierarchical structure from a sequence of discrete symbols. Site includes examples, source code, description, publications, and an on-line demonstration. http://sequence.rutgers.edu/sequitur/ An Improved Comb Sort with Pre-defined Gap Table The original comb sort is vulnerable to seriously degraded performance with certain repetitive input sequences. This variation addresses those problems and bounds worst case perfor mance. http://world.std.com/~jdveale/combsort.htm Understanding SoundEx Algorithms 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. http://www.creativyst.com/Doc/Articles/SoundEx1/SoundEx1.htm Ternary Search Trees Algorithm for search. PDF file and examples in C. http://www.cs.princeton.edu/~rs/strings/ Sorting Algorithms Explanation, algorithm analysis, empirical data, and source code for the bubble, heap, insertion, merge, quick, selection, and shell sorts. http://linux.wku.edu/~lamonml/algor/sort/sort.html Fast Median Search Overview of algorithms to find the median in a list of values; implementations and links are also provided. http://ndevilla.free.fr/median |
