InterviewSolution
Saved Bookmarks
| 1. |
In special case, the time complexity of inserting/deleting elements at the end of dynamic array is __________(a) O (n)(b) O (n^1/2)(c) O (log n)(d) O (1)Question is taken from Dynamic Array topic in division Arrays Types of Data Structures & Algorithms II have been asked this question during an interview. |
|
Answer» Correct CHOICE is (a) O (n) |
|