Stable sort

A stable sort is a sorting algorithm that does not change the relative order of elements that have equal key values. This is important for some algorithms (for example, radix sort).

Some common stable sorts are:

• bubble sort
• [bucket sort]?
• [counting sort]?
• merge sort
• radix sort

Many other sorting algorithms can be specially implemented to be stable sorts.