Choose the correct description of Quick sort.
- A. An algorithm that finds the shortest path between nodes in a graph with non-negative edge weights.
- B. An algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum.
- C. A divide-and-conquer sorting algorithm that partitions elements around a pivot value. ✓
- D. A divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.
Correct answer
C. A divide-and-conquer sorting algorithm that partitions elements around a pivot value.
Explanation
Quick sort refers to a divide-and-conquer sorting algorithm that partitions elements around a pivot value.