Merge sort uses which of the following technique to implement sorting?
(a) backtracking
(b) greedy algorithm
(c) divide and conquer
(d) dynamic programming
This question was addressed to me in an online quiz.
My doubt stems from Sorting in division Sorting of Data Structures & Algorithms II