Sorting-Algorithms gives us an animation to illustrate how
sorting algorithms work. An algorithm defines the steps to be taken to resolve a problem. Sorting algorithms, as its name suggests, aims to sort a number of elements. There are other pages that shows animations like this, but this one is the best I've seen.
Algorithms that includes the site are: Insertion, Selection, Bubble, Shell, Merge, Heap, Quick and Quick3.

We can vary the initial ordering of the elements, the can be: Random, nearly sorted, reversed or with few unique.
The webpage tries to show this:
- How each algorithm operates
- That there is no best sorting algorithm.
- The advantages and disadvantages of each algorithm.
- That worse-case asymptotic behavior is not the deciding factor in choosing an algorithm.
- That the initial condition (input order and key distribution) affects performance as much as the algorithm choice.
Link:
Sorting-Algorithms.
Via:
FeedMyApp.