In divide and conquer, the time is taken for merging the subproblems is?
|B.||o(n log n)|
|Answer» B. o(n log n)|
|Explanation: the time taken for merging the smaller subproblems in a divide and conquer approach is mathematically found to be o(n log n).|
Login to Continue
It will take less than 2 minutes