In divide and conquer, the time is taken for merging the subproblems is?
(a) O(N)
(b) O(N log N)
(c) O(N^2)
(d) O(log N)
I got this question in quiz.
My doubt stems from Computational Geometry topic in division Computational Geometry of Data Structures & Algorithms II