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