Abstract Data Types on Data Structure and Algorithms related Questions and Answers


Question :   What is the time complexity of inserting at the end in dynamic arrays?

1. O(1)
2. O(n)
3. O(logn)
4. Either O(1) or O(n)
Answer :   4 - Either O(1) or O(n)  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter