The correct answer is option 'C' - Divide and conquer.

Explanation:
Quick sort is a highly efficient sorting algorithm that follows the divide and conquer approach. It 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. The sub-arrays are then recursively sorted.

Divide and conquer is a common algorithm design technique that breaks a problem into smaller sub-problems, solves them independently, and then combines the solutions to solve the original problem. It can be summarized in the following steps:

1. Divide: The problem is divided into smaller sub-problems that are similar to the original problem but of reduced size.

In quick sort, the array is divided into two sub-arrays based on the pivot element.

2. Conquer: Each sub-problem is solved recursively.

In quick sort, the two sub-arrays are independently sorted using the same quick sort algorithm.

3. Combine: The solutions to the sub-problems are combined to solve the original problem.

In quick sort, no explicit combination step is required as the sub-arrays are sorted in-place.

Quick sort is a well-known example of the divide and conquer technique, where the problem of sorting a large array is broken down into smaller sub-arrays and then combined to obtain a fully sorted array. This technique allows for efficient sorting of large datasets and is widely used in practice.

To summarize, the quick sort algorithm uses the divide and conquer technique to efficiently sort an array by recursively dividing it into smaller sub-arrays, solving them independently, and then combining the solutions.