| Common comparison sorts | | Explanation, algorithm analysis, empirical data, and source code for the bubble, heap, insertion, merge, quick, selection, and shell sorts. |
| Comparison sort | | From Wikipedia, the free encyclopedia. Definition, examples, lower bound. |
| Fast Median Search | | Overview of algorithms to find the median in a list of values; implementations and links are also provided. |
| 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. |
| 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. |
| Postman's Sort | | A linear time general purpose sorting algorithm. Included is a description of the algorithm and downloadable executables for Windows computers. |
| RumAVL | | An ANSI C implementation of threaded AVL trees. |
| Search Algorithm | | From Wikipedia, the free encyclopedia. Classification, summaries of the popular searching algorithms, links. | |
|