Vidyalelo
Data Structure · Q1039

Miscellaneous on Data Structures

Programming · Data Structure · question 1039

Q1039

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(N2)
Answer
D.
O(N3 log N)

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board