The animations on this page illustrate a number of different sequential and parallel sorting algorithms. The relative execution times of the animations give a very rough idea of the relative speeds of the algorithms. Each algorithm is finished when its colored lines disappear.
|Bubble Sort||Quick Sort||O-E Tran. Sort||Shear Sort|
All the implementations are subclasses of the class SortAlgorithm, which uses the class SortItem. Both of these classes were designed and implemented by James Gosling, who also implemented Bubble Sort and Quick Sort.
My implementation of Shear Sort requires a minor modification to SortAlgorithm and SortItem.