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

Algorithm for search. PDF file and examples in C.

Explanation, algorithm analysis, empirical data, and source code for the bubble, heap, insertion, merge, quick, selection, and shell sorts.

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.

A web text by Thomas Niemann, also available in PDF, with C source code examples.

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.

A web tutorial by Mark Baker.

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

A Java implementation of the Wealthy Adaptative Search Algorithm, a constraint-solving algorithm using a stochastic approach. Sourceforge/GPL.

By Thomas Niemann.

Algorithms and data structures. Source code in C and VB is included. Demonstration applets in Java.

A linear time general purpose sorting algorithm. Included is a description of the algorithm and downloadable executables for Windows computers.

A specification of a new 'bubble sort' in three or more dimesions, with illustrative images.

An O(n!) algorithm with downloads for Win98 and Unix platforms.

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.

Documentation of a C++ project by Dogan Can and Serdar Kemal Balci.

From Wikipedia, the free encyclopedia. Classification, summaries of the popular sorting algorithms, links.

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

Details of this collection of binary search tree and balanced tree library routines by Ben Pfaff. Etext in HTML/PDF/PS and source distribution.