The original comb sort is vulnerable to seriously degraded performance with certain repetitive input sequences. This variation addresses those problems and bounds worst case perfo...
http://world.std.com/~jdveale/combsort.htm
Explanation, algorithm analysis, empirical data, and source code for the bubble, heap, insertion, merge, quick, selection, and shell sorts.
http://linux.wku.edu/~lamonml/algor/sort/sort.html
Sorting by in place permutation with time complexity O(n) using an auxiliary vector. Papers, animations and implementations.
http://www.neubert.net/FSOIntro.html
Details of this collection of binary search tree and balanced tree library routines by Ben Pfaff. Etext in HTML/PDF/PS and source distribution.
http://www.stanford.edu/~blp/avl/
Resources on the Levenshtein Algorithm for fault-tolerant search. Website contains online demos and efficient implementations.
http://www.levenshtein.net
An explanation of the sorting algorithms Quicksort, Heapsort, Shellsort, Mergesort, sorting networks such as Odd-even transposition sort, Bitonic sort and parallel sorting algorith...
http://www.iti.fh-flensburg.de/lang/algorithmen/sortieren/algoen.htm
Copyright 2006-2008 Webmasters, Inc. All Rights Reserved Worldwide. Patent Pending MasterMoz and its emblems are trademarks of Webmasters, Inc. Any other trademarks or trade names used on this website are the property of their respective owners.
Special Offer for Dmoz Editors
Supplemental listings provided by the Open Directory
Help build the largest human-edited directory on the web.