Question: A sorting algorithm is called stable if the order of equal elements is preserved after sorting. Which of the following sorting algorithms are stable? If

A sorting algorithm is called stable if the order of equal elements is preserved after sorting. Which of the following sorting algorithms are stable? If yes, briefly justify it, and if no, give a counter example. (a) SELECTIONSORT (b) INSERTIONSORT (c) BUBBLESORT (d) BOTTOMUPSORT (e) HEAPSORT (g) QUICKSORT (f) RADIXSORT. (h) MERGESORT
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
