2,649 views
0 votes
0 votes
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....

4 Answers

2 votes
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.
0 votes
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/

 

0 votes
0 votes
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

Related questions

1 votes
1 votes
2 answers
1
jenny101 asked May 22, 2016
6,005 views
Has anybody tried this book?Is this book good to practice for gate and psus especially psus?
0 votes
0 votes
1 answer
3
Shikha Mallick asked Mar 12, 2018
804 views
The $n^{th}$ order difference of a polynomial of degree $n$ iszeroonesome constantundefinedPlease explain the solution.
4 votes
4 votes
1 answer
4
Sankaranarayanan P.N asked Aug 23, 2016
3,641 views
Memory Protection is of no use in a) single user systemsb) non multiprogrammed systemsc) non multitasking systemsd) none of the above