Question

Which one of the below is not divide and conquer approach?
O Insertion Sort
O Merge Sort
O Heap Sort
O Shell Sort​

Answer 1

Answer:

b- merge sort

this is the correct answer of your question