Q352
What is the optimal time required for solving the closest pair problem using divide and conquer approach?
A.
O(N)
B.
O(log N)
C.
O(N log N)
AnswerD.
O(N2)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board