What is the worst case time complexity of insertion operation(n =no. o – McqOptions

MCQOPTIONS

1.	What is the worst case time complexity of insertion operation(n =no. of candidates)?
A.	O(1)
B.	O(n)
C.	O(log n)
D.	O(n log n)
Answer» B. O(n)

Discussion

No Comment Found

Related MCQs

Bigger the query rectangle the better is the query efficiency.
Efficiency of bin depends upon ___________
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)
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)
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)
What is computational geometry?
What is the worst case time complexity of insertion operation(n =no. of candidates)?
What is the worst case time complexity of delete operation(n is the no. of candidates)?
What is the worst case time complexity of query operation(n is the no. of candidates)?
Bin is an example of a range query data structure.