A sorting technique that guarantees that records with the same primary key occurs in the same
Stable
If you sort this list based on the primary key (the number), a stable sorting algorithm would ensure that because (5, A) appeared before (5, C) in the original list, it will also appear before (5, C) in the sorted list.
Important Questions from Sorting - Teaching
Which of the following is stable sort
Arrange the following items in ascending order using Bubble Sort. What is the intermediate sequence of 37, 54, 21, 85, 68, 12, 9, and 57 after the second pass?
Which of the following algorithm design approach is used in Quick sort algorithm?
What is the worst case running time of quick sort algorithm?
Sort the following list using the Radix sort algorithm.
329, 457, 839, 436, 720, 355, 657
What is the output of the algorithm after the second pass?
