A sorting algorithm is stable if

Related MCQs

• Which of the following sorting methods would be most suitable for sorting a list which is almost sorted
• Which sorting algorithm can exploit the partially sorted data in a list?
• The following sorting algorithm is of divide- and-conquer type
• By using which of the following methods sorting is not possible?
• Examples of sorting algorithms are
• Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively.
• Sorting is useful for_________
• 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
• You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order?
• Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficienty?