Which of the following is an example of a divide-and-conquer algorithm ?

The correct answer is Quick sort (Option 2). It is a classic example of a divide-and-conquer algorithm that works by selecting a 'pivot' element and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.