---

Solution

Quick sort uses the divide and conquer technique.

In Quick sort, first we choose a pivot element.

Then the array is divided into two parts:

Elements smaller than pivot

Elements greater than pivot

After partitioning, Quick sort is applied recursively on both parts.

So, the problem is divided into smaller subproblems and then solved recursively.

This is exactly the divide and conquer approach.