Features naive implementations of standard sorting algorithms in Java. Never use these, use the ones in the Collection Framework
All of the current comparison sort implementations are 'in-place'.
- Bubble. Two implementations, one with a fixed number of passes.
- Insertion.
- Merge
- Quicksort
- Counting Sort
- Pigeonhole Sort (particularly messy)
There is various logging to show the state at various points.