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.

This article is a stub. You can help Programmer's Wiki by expanding it. Remember to remove this when the stub is fixed.