DEV Community

Cover image for Stability in Sorting Algorithms
Harsh Bhardwaj
Harsh Bhardwaj

Posted on

Stability in Sorting Algorithms

#dsa #datastructures #tutorial #learning

**

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-

  1. Bubble Sort
  2. Merge Sort
  3. Insertion Sort

Difference between Stable and Unstable

Image description

Top comments (0)

Read next

mayallo profile image

Unit, Integration, and E2E Testing in One Example Using Jest

Mohamed Mayallo -

hreuven profile image

CSS: Easy dark mode

Reuven Hozias -

tutortacademy profile image

Regrets Every Programmer Faces: Lessons for Aspiring Coders

Tutort Academy -

jaber1028 profile image

Landing Your First CS Internship: A Strategic Guide

Jacob aberasturi -