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

Explanation

Concept The stability of a sorting algorithm is concerned with how the algorithm treats equal (or repeated) elements. A sorting algorithm is said to be stable if two objects with equal keys (primary key) appear in the same order in sorted list as they appear in the original unsorted list. Explanation: Some sorting algorithms are stable by nature like Insertion sort, Merge Sort, Bubble Sort, etc. And some sorting algorithms are not, like Heap Sort, Quick Sort, etc.