Which of the following is NOT a characteristic of Quick Sort?

Which of the following is NOT a characteristic of Quick Sort?

Step 1: Understand what Quick Sort is. It is a sorting algorithm that organizes data in a specific order.
Step 2: Learn about characteristics of sorting algorithms. Some important characteristics include stability, time complexity, and space complexity.
Step 3: Identify what 'stable sorting' means. A stable sorting algorithm keeps equal elements in the same order they appeared in the original list.
Step 4: Recognize that Quick Sort does not maintain the order of equal elements. This means it is not stable.
Step 5: Conclude that the characteristic of being 'not stable' is a key feature of Quick Sort.

No concepts available.