Vidyalelo
Data Structure · Q348

Miscellaneous on Data Structures

Programming · Data Structure · question 348

Q348

In divide and conquer, the time is taken for merging the subproblems is?

A.
O(N)
B.
O(N log N)
Answer
C.
O(N2)
D.
O(log N)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board