Sorting Characteristics

Stability

A sorting algorithm is said to be stable if it preserves the order of elements given in the unsorted list.

In-Place

A sorting algorithm is said to be in-place if it does not require any extra memory - i.e it does not create any new arrays.