Question

You are writing a program and want to use a divide and conquer method for sorting the data, a pivot point, and recursion. Which of the following algorithms would fit all the criteria?(1 point)
Responses

merge sort
merge sort

bubble sort
bubble sort

quick sort
quick sort

binary search

Answer 1

The algorithm that fits all the criteria of using a divide and conquer method for sorting the data, a pivot point, and recursion is **quick sort**.

Quick sort works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. It then recursively applies the same procedure to the sub-arrays.

So the correct response is:

**quick sort**