Question

What is the runtime efficiency of using brute force technique for the closest pair problem?

(a) O(N)

(b) O(N log N)

(c) O(N^2)

(d) O(N^3  log N)

I got this question in class test.

The origin of the question is Computational Geometry in portion Computational Geometry of Data Structures & Algorithms II

Answer 1

Right answer is (c) O(N^2)

Easy explanation - The efficiency of closest pair algorithm by brute force technique is mathematically found to be O(N^2).