+1 vote
in Data Structures & Algorithms I by (88.2k points)
What is the worst case of finding the nearest neighbour?

(a) O(N)

(b) O(N log N)

(c) O( log N)

(d) O(N^3)

Enquiry is from Trees topic in division Trees of Data Structures & Algorithms I

The question was asked during an interview.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Correct answer is (a) O(N)

The explanation is: The worst case analysis of finding the nearest neighbour in a k-d tree is mathematically found to be O(N).

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...