Animated Sorting Algorithm Demo: Random Initial Order

Discussion

A random initial order is often used to evaluate sorting algorithms in order to elucidate the "typical" case and to facilitate mathematical analysis. For some applications, however, this does not represent the typical case, so conclusions drawn here do not generalize.

Here we see the vast difference in speed between the O(n²) elementary sorting algorithms (insert, selection, bubble) and the more advanced algorithms.

Directions

• Click on to restart the animations.
• Click on a size number to change the size of the examples.
• Click on a cell to restart an individual animation.
• Click on a cell title to explore that algorithm.

Key

• Black values are sorted.
• Gray values are unsorted.
• A red triangle marks the algorithm position.
• Dark gray values denote the current interval (shell, merge, quick).
• A pair of red triangles marks the left and right pointers (quick).