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

techelopment profile image

Embed HTML Files Without Using Server Side Scripting or JavaScript

Techelopment -

jhernandez504 profile image

Intro into Tailwind CSS

Jeremy Hernandez -

luqmanbello profile image

Building Production-Grade ECS Anywhere Infrastructure with Custom Capacity Providers

Luqman Bello -

emma_richardson profile image

10 Best Visual Studio Code Extensions for Front-End Developers

Emma Richardson -