** Sorting Algorithm Stability Defined and Explained

Sorting algorithm stability refers to the property of preserving the relative order of equal elements after sorting. This concept is essential in databases where secondary keys require stable ordering.

Source: https://dev.to/harsh_bhardwaj_809a89d3a7/stability-in-sorting-algorithms-18hd