public abstract class Sorter
extends java.lang.Object
Information about each algorithm's time/memory complexity and stability
is provided in their respective classes.
n is the number of records to be sorted.
A sorting algorithm is stable if
whenever there are two records R and S with the same key
and with R appearing before S in the original list,
R will appear before S in the sorted list.