A divide-and-conquer sorting algorithm that partitions elements around a pivot value. What is this concept called?
- A. Time complexity
- B. Merge sort
- C. Quick sort ✓
- D. Dijkstra's algorithm
Correct answer
C. Quick sort
Explanation
Quick sort refers to a divide-and-conquer sorting algorithm that partitions elements around a pivot value.