Which of the following is an example of a divide-and-conquer algorithm ?
2025
Which of the following is an example of a divide-and-conquer algorithm ?
Answer: B. Quick sort — 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…
- A.
Bubble sort
- B.
Quick sort
- C.
Insertion sort
- D.
Linear search
Attempted by 572 students.
Show answer & explanation
Correct answer: B
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.
Loading lesson…