WebDirectory Search :: 
Search

See also:


    Open in a new Window   » Common comparison sorts - Explanation, algorithm analysis, empirical data, and source code for the bubble, heap, insertion, merge, quick, selection, and shell sorts.

    Open in a new Window   » Compact Guide to Sorting and Searching - Algorithms and data structures. Source code in C and VB is included. Demonstration applets in Java.

    Open in a new Window   » Comparison sort - From Wikipedia, the free encyclopedia. Definition, examples, lower bound.

    Open in a new Window   » Dictionary Implementation using Red and Black Tree - Documentation of a C++ project by Dogan Can and Serdar Kemal Balci.

    Open in a new Window   » Discussion of Sorting Algorithms - A web tutorial by Mark Baker.

    Open in a new Window   » Exact string matching algorithms - Common pattern search approaches with C implementations.

    Open in a new Window   » Fast Median Search - Overview of algorithms to find the median in a list of values; implementations and links are also provided.

    Open in a new Window   » Fast multi-pattern search - A fast algorithm for multi-pattern searching by Sun Wu [PDF]

    Open in a new Window   » Fibonacci search in C - Fibonacci search and C sample code.

    Open in a new Window   » FlashSort - Sorting by in place permutation with time complexity O(n) using an auxiliary vector. Papers, animations and implementations.

    Open in a new Window   » Fuzzy Search - Approximate search resources on ITman homepage.

    Open in a new Window   » 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.

    Open in a new Window   » 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.

    Open in a new Window   » Levenshtein Algorithm For Error-Tolerant Search - Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online demos and efficient implementations.

    Open in a new Window   » Postman's Sort - A linear time general purpose sorting algorithm. Included is a description of the algorithm and downloadable executables for Windows computers.

    Open in a new Window   » Robsort Sorting Algorithm - An O(n!) algorithm with downloads for Win98 and Unix platforms.

    Open in a new Window   » RumAVL - An ANSI C implementation of threaded AVL trees.

    Open in a new Window   » Search Algorithm - From Wikipedia, the free encyclopedia. Classification, summaries of the popular searching algorithms, links.

    Open in a new Window   » Search Methods in AI - Brief summary of fundamental problem space search algorithms.

    Open in a new Window   » Searching Algorithms - Overview of many sorting techniques and corresponding links.

    Open in a new Window   » Sequential and parallel sorting algorithms - Description of sorting algorithms with examples

    Open in a new Window   » Sequitur - Infers an hierarchical structure from a sequence of discrete symbols. Site includes examples, source code, description, publications, and an on-line demonstration.

    Open in a new Window   » sortchk - A simple test suite to measure the costs (in terms of needed comparisons and needed data moves) of different sorting algorithms. Unix sources.

    Open in a new Window   » Sorting Algorithm - From Wikipedia, the free encyclopedia. Classification, summaries of the popular sorting algorithms, links.

    Open in a new Window   » Sorting Algorithm Examples - Collection of sorting algorithms in C

    Open in a new Window   » Sorting Algorithms - Overview of many sorting techniques and corresponding links.

    Open in a new Window   » Sorting Algorithms Visualized - Applet visualizing various sorting algorithms, English version of Peter Weigel and Andreas Boltzmann applet.

    Open in a new Window   » Sorting and Searching Algorithms By Thomas Niemann. - Collection of algorithms for sorting and searching from arrays to B-Trees - theory, examples, implementation. [PDF]

    Open in a new Window   » String Searching - From Wikipedia, the free encyclopedia. Definition, classification, common algorithms, links.

    Open in a new Window   » String Searching With Suffix Trees - Fast String Searching With Suffix Trees by Mark Nelson

    Open in a new Window   » Suffix Tree - 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.

    Open in a new Window   » Ternary Search Trees - Fast Algorithms for Sorting and Searching Strings - The original paper and examples by Jon Bentley and Robert Sedgewick.

    Open in a new Window   » Three Dimensional Bubble Sort - A specification of a new 'bubble sort' in three or more dimesions, with illustrative images.

    Open in a new Window   » 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.

    Open in a new Window   » WASA - A Java implementation of the Wealthy Adaptative Search Algorithm, a constraint-solving algorithm using a stochastic approach. Sourceforge/GPL.



Help build the largest human-edited directory on the web.        Previews by Thumbshots - Submit a Site - Open Directory Project - Become an Editor
C o p y r i g h t   ©   A r a b L a n d . c o m