What will be the time complexity of insertion operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects)

Category: QuestionsWhat will be the time complexity of insertion operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects)
Editor">Editor Staff asked 1 month ago

What will be the time complexity of insertion 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)
 
(c) O(m^2)
 
(d) O(log m)
 
The query is from Trees in section Trees of Data Structures & Algorithms I
 
The question was asked in homework.

1 Answers
Editor">Editor Staff answered 1 month ago

Correct choice is (b) O(m)
 
Easy explanation – The process of insertion becomes faster in the case when the number of candidates are equally distributed among the bins. In such a case the query operation becomes O(m). It is practically faster than deletion in this case.