Q99
What will be the time complexity of query operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (k = number of bins query rectangle intersects)
A.
O(1)
B.
O(k)
AnswerC.
O(k2)
D.
O(log k)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board