Stability in Sorting Algorithms
Harsh Bhardwaj
Posted on November 17, 2024
**
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
💖 💪 🙅 🚩
Harsh Bhardwaj
Posted on November 17, 2024
Join Our Newsletter. No Spam, Only the good stuff.
Sign up to receive the latest update from our blog.
Related