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 performance.
Common comparison sorts
Explanation, algorithm analysis, empirical data, and source code for the bubble, heap, insertion, merge, quick, selection, and shell sorts.
Compact Guide to Sorting and Searching
Algorithms and data structures. Source code in C and VB is included. Demonstration applets in Java.
Comparison sort
From Wikipedia, the free encyclopedia. Definition, examples, lower bound.
Dictionary Implementation using Red and Black Tree
Documentation of a C++ project by Dogan Can and Serdar Kemal Balci.
Discussion of Sorting Algorithms
A web tutorial by Mark Baker.
Exact string matching algorithms
Common pattern search approaches with C implementations.
Fast Median Search
Overview of algorithms to find the median in a list of values; implementations and links are also provided.
Fast multi-pattern search
A fast algorithm for multi-pattern searching by Sun Wu
Fibonacci search in C
Fibonacci search and C sample code.
FlashSort
Sorting by in place permutation with time complexity O(n) using an auxiliary vector. Papers, animations and implementations.
Fuzzy Search
Approximate search resources on ITman homepage.
GNU libavl
Details of this collection of binary search tree and balanced tree library routines by Ben Pfaff. Etext in HTML/PDF/PS and source distribution.
Levenshtein Algorithm For Error-Tolerant Search
Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online demos and efficient implementations.
Parallel and Sequential Sorting Algorithms
An explanation of the sorting algorithms Quicksort, Heapsort, Shellsort, Mergesort, sorting networks such as Odd-even transposition sort, Bitonic sort and parallel sorting algorithms for two-dimensional processor arrays. All including animations.
Results: 1 2 3 Next
