**
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
For further actions, you may consider blocking this person and/or reporting abuse
Fixing code doesn’t have to be the worst part of your day. Learn how Sentry can help.
JetThoughts Dev -
rahul-haveri -
Luca Liu -
Ian -
Top comments (0)