A

Admin • 833K Points
Coach

Q. 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)
  • (D) o(n2)

Explanation by: Admin

the optimal time for solving using a divide and conquer approach is mathematically found to be o(n log n).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.