Sorting Algorithms

This Demonstration compares four different sorting algorithms: insertion sort, bubble sort, heap sort, and shell sort. They are applied to sorting a random permutation of the first 70 integers. The bubble and heap sort show every single swap made, and the shell sort shows the result of every successive bubble sort. The insertion sort shows the result of every pass (above the level of individual swaps).