Computers, Algorithms, Sorting and Searching
See Also:
- Details of this collection of binary search tree and balanced tree library routines by Ben Pfaff. Etext in HTML/PDF/PS and source distribution.
- 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.
- A web text by Thomas Niemann, also available in PDF, with C source code examples.
- A web tutorial by Mark Baker.
- An O(n!) algorithm with downloads for Win98 and Unix platforms.
- From Wikipedia, the free encyclopedia. Classification, summaries of the popular sorting algorithms, links.
- Explanation, algorithm analysis, empirical data, and source code for the bubble, heap, insertion, merge, quick, selection, and shell sorts.
- A simple test suite to measure the costs (in terms of needed comparisons and needed data moves) of different sorting algorithms. Source and various unix binaries.
- By Thomas Niemann.
- 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.
- Algorithms and data structures. Source code in C and VB is included. Demonstration applets in Java.
- Documentation of a C++ project by Dogan Can and Serdar Kemal Balci.
- A Java implementation of the Wealthy Adaptative Search Algorithm, a constraint-solving algorithm using a stochastic approach. Sourceforge/GPL.
- Algorithm for search. PDF file and examples in C.
- Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online demos and efficient implementations.
- A linear time general purpose sorting algorithm. Included is a description of the algorithm and downloadable executables for Windows computers.
- 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.
- Infers a hierarchical structure from a sequence of discrete symbols. Site includes examples, source code, description, publications, and an on-line demonstration.
- Sorting by in place permutation with time complexity O(n) using an auxiliary vector. Papers, animations and implementations.
- 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 specification of a new 'bubble sort' in three or more dimesions, with illustrative images.
- Overview of algorithms to find the median in a list of values; implementations and links are also provided.
|

|
|