Vidyalelo
Data Structure · Q81

Arrays in Data Structures

Programming · Data Structure · question 81

Q81

In special case, the time complexity of inserting/deleting elements at the end of dynamic array is . . . . . . . .

A.
O (n)
Answer
B.
O (n1/2)
C.
O (log n)
D.
O (1)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board