Which of the following algorithm design techniques is used in the merge sort algorithm?
Show answerHide answer
Correct answer: (C) Divide and conquer
Explanation
Merge sort uses divide and conquer: it splits the array into halves, sorts each half recursively and then merges the two sorted halves.