Book: MCQs in Computer Science by TJ williams

Question

A sorting technique that guarantees that records with same primary key in the same order in the sorted list as in the original unsorted list is said to be....

Comments

Stable Sorting Technique.

Answer 1

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.

Answer 2

Stable sorting method in which order of two data having same values is maintained

Answer 3

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/

 

Answer 4

This is stable sorting algorithm which maintains the relative order between the same elements as the original array. Example: Merge sort, Insertion sort,Counting sort,Bubble sort etc