Multiple choice

Which of these techniques does not use the divide and conquer policy?

  1. Merge sort

  2. Heap sort

  3. Binary search

  4. Insertion sort

  5. Quick sort

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

 Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is a sequential technique.