Stable Sorting Algorithm

A sorting algorithm is stable if, the relative position of items is retained after sorting.

Example

• The blue ball is still before the purple ball after sorting