Q62
What is the worst case time complexity of insertion operation(n =no. of candidates)?
A.
O(1)
AnswerB.
O(n)
C.
O(log n)
D.
O(n log n)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board