Q99
What is the complexity of given function of insertion. insert(int n) if(buffer_size()< maxi_biffer_size()) buffer_aar[ind]==n; else move_to_heap(buffer,buffer+maxi_buffer_size())
A.
O(logn)
B.
amortized O(1)
AnswerC.
O(n)
D.
O (n*logn)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board