**
Definition-
**
Stability in a sorting algorithm refers to the preservation of the relative order of records with equal values. Useful in Databases where secondary keys need to be stable.
Examples-
- Bubble Sort
- Merge Sort
- Insertion Sort
Difference between Stable and Unstable
