Stable Sort Vs Unstable Sort

1014

  • The stability of a sorting algorithm is concerned with how the algorithm treats equal (or repeated) elements. Stable sorting algorithms preserve the relative order of equal elements, while unstable sorting algorithms don’t. In other words, stable sorting maintains the position of two equals elements relative to one another.

  • Stable sorting maintains the order of the two equal balls numbered 8, whereas unstable sorting may invert the relative order of the two 8s.

  • Several common sorting algorithms are stable by nature, such as Merge Sort, Timsort, Counting Sort, Insertion Sort, and Bubble Sort. Others such as Quicksort, Heapsort and Selection Sort are unstable.

  • We can modify unstable sorting algorithms to be stable. For instance, we can use extra space to maintain stability in Quicksort.

Refrence Taken From : https://www.baeldung.com/cs/stable-sorting-algorithms