The three criteria of sorting techniques are:
Stability: Stable sort keeps records with the same key in the
same qualified order that they were in before the sort.
Time: The time related to the swaps and comparisons of
elements in the algorithm.
Space: The space may be dependent or independent of the
input sequence size. If the additional space needed in the
algorithm is independent to the input, its space complexity is
O (1), otherwise O (n).