Programmer's Wiki
Advertisement

A sorting algorithmm is said to be stable if individual items that are considered equal retain their original order in the list. Such an algorithm is called a stable sort.

16px-Pencil
Advertisement