What is the optimal time required for solving the closest pair problem using divide and conquer approach?
|C.||o(n log n)|
|Answer» C. o(n log n)|
|Explanation: the optimal time for solving using a divide and conquer approach is mathematically found to be o(n log n).|
Login to Continue
It will take less than 2 minutes