Multiple choice Which of these techniques does not use the divide and conquer policy? Merge sort Heap sort Binary search Insertion sort 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.