MetaXearch > / Algorithms / Sorting and Searching /
Fast Median Search
Overview of algorithms to find the median in a list of values; implementations and links are also provided. (infos)Ternary Search Trees
Algorithm for search. PDF file and examples in C. (infos)
Common comparison sorts
Explanation, algorithm analysis, empirical data, and source code for the bubble, heap, insertion, merge, quick, selection, and shell sorts. (infos)
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. (infos)
Sorting and Searching Algorithms: A Cookbook
A web text by Thomas Niemann, also available in PDF, with C source code examples. (infos)
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. (infos)
Discussion of Sorting Algorithms
A web tutorial by Mark Baker. (infos)
FlashSort
Sorting by in place permutation with time complexity O(n) using an auxiliary vector. Papers, animations and implementations. (infos)
WASA
A Java implementation of the Wealthy Adaptative Search Algorithm, a constraint-solving algorithm using a stochastic approach. Sourceforge/GPL. (infos)
A Compact Guide to Sorting and Searching
By Thomas Niemann. (infos)