Which of the following is not a stable sorting algorithm?

Explanation: A stable sorting algorithm maintains the relative order of equal elements. Quick sort is not stable because its partitioning step can change the order of equal elements. In contrast, cocktail sort, bubble sort, and merge sort are stable as they preserve the relative order of equal elements during sorting.