Which of the following is not a stable sorting algorithm in its typical implementation.
A)insertion sort
B)merge sort
C)quick sort
D)bubble sort

Question

Quizplus · Accepted Answer

Quick sort, in its typical implementation, is not a stable sorting algorithm because equal elements can be ordered differently depending on the pivot's position throughout the sorting process. Stability in sorting algorithms means that two records with equal keys appear in the same order in sorted output as they appear in the input unsorted array. Quick sort can rearrange equal elements, making it unstable.

Which of the Following Is Not a Stable Sorting Algorithm