Stable matching algorithms

Does not change the order of similar elements. The opposite of Unstable Matching Algorithms. This is best represented by this example $L=[(3,b),(2,b),(3,a),(2,c)]$ → $L=[(2,b),(2,c),(3,b),(3,a)]$

Some examples are:

• Insertion Sort
• Merge-Sort
• Counting Sort