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.... Nukku asked Sep 21, 2019 Nukku 2.6k views answer comment Share Follow See 1 comment See all 1 1 comment reply penden commented Oct 8, 2019 reply Follow Share Stable Sorting Technique. 0 votes 0 votes Please log in or register to add a comment.
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. `JEET answered Sep 22, 2019 `JEET comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Stable sorting method in which order of two data having same values is maintained Shagun Singh answered Oct 16, 2019 Shagun Singh comment Share Follow See all 0 reply Please log in or register to add a comment.
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/ HanuamntappaBudihal answered Dec 2, 2019 HanuamntappaBudihal comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Pratyush Priyam Kuan answered Feb 11, 2020 Pratyush Priyam Kuan comment Share Follow See all 0 reply Please log in or register to add a comment.