0 votes 0 votes Which of the following is not a stable sorting algorithms ? Insertion sort Selection sort Bubble sort Merge sort Algorithms algorithms + – rsansiya111 asked Dec 6, 2021 rsansiya111 557 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Answer B. 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. Stable sorting: Bubble Sort, Insertion Sort, Merge Sort, Count Sort etc. Unstable sorting: Quick Sort, Heap Sort etc. Stability in sorting algorithms - GeeksforGeeks raja11sep answered Dec 6, 2021 raja11sep comment Share Follow See all 0 reply Please log in or register to add a comment.