1.

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)
C. O(k<sup>2</sup>)
D. O(log k)
Answer» C. O(k<sup>2</sup>)


Discussion

No Comment Found

Related MCQs