http://www.cs.rit.edu/~atk/Java/Sorting/sorting.html shows four sorting algorithms and animations for each. It shows Bubble, Quick, Odd-Even Transposition, and Shear sorts. The last two are multi-processor sorts so I have 2 questions:
- Could Bubble and Quick sort be changed to multi-processor sorts? It seems that Quick Sort could be.
- How would they compare in time to the other multi-processor sorts? It would be especially interesting how Quick Sort would compare.