Data Structures :: Searching & Sorting - Discussion

A stable sorting algorithm is the one that sorts the identical elements in the same order as they appear in the input, whilst unstable sorting may not satisfy the case.

Stable Sorting Algorithms:

Insertion Sort
Merge Sort
Bubble Sort
Tim Sort
Counting Sort

Unstable Sorting Algorithms:

Heap Sort
Selection sort
Shell sort
Quick Sort

heap sort is not stable . Insertion and bubble both of these are stable.

Insertion and bubble both are stable