Stable Sorting Technique.

The Gateway to Computer Science Excellence

+2 votes

Its called $\bf{stable}$ sorting technique.

This maintains the same position of the elements even after getting sorted.

Insertion, Bubble and Merge sorts are stable sorting algoritms.

This maintains the same position of the elements even after getting sorted.

Insertion, Bubble and Merge sorts are stable sorting algoritms.

0 votes

Its called stable sorting technique.

A sorting algorithm is said to be stable if two objects with equal keys appear in the same order in sorted output as they appear in the input array to be sorted.

Some Sorting Algorithms are stable by nature, such as **Bubble Sort, Insertion Sort, Merge Sort, Count Sort** etc.

You can find the good explanation here https://www.geeksforgeeks.org/stability-in-sorting-algorithms/

52,223 questions

59,815 answers

201,020 comments

118,087 users