The divide and conquer strategy involves dividing a problem into smaller subproblems, solving each subproblem, and combining the results. Quick sort is a classic example of the divide and conquer approach as it divides the array into smaller parts and recursively sorts them.
Thus, the correct answer is \( \text{Quick sort} \).