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

In special case, the time complexity of inserting/deleting elements at the end of dynamic array is __________ Correct Answer O (n)

In general, the time complexity of inserting or deleting elements at the end of dynamic array is O (1). Elements are added at reserved space of dynamic array. If this reserved space is exceeded, then the physical size of the dynamic array is reallocated and every element is copied from original array. This will take O(n) time to add new element at the end of the array.
Bissoy MCQ

Related Questions

A material is loaded elastically under plane stress condition given by the following tensor:
\[\left[ {\begin{array}{*{20}{c}} 1 \\ 0 \end{array}\begin{array}{*{20}{c}} 2 \\ 1 \end{array}\begin{array}{*{20}{c}} 0 \\ 0 \end{array}} \right
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. You have to find the minimum number of jumps that are required to reach the end of the array. Which of these methods can be used to solve the problem?
Statement 1: In insertion sort, after m passes through the array, the first m elements are in sorted order. Statement 2: And these elements are the m smallest elements in the array.
Consider the Quick sort algorithm in which the partitioning procedure splits elements into two sub-arrays and each sub-array contains at least one-fourth of the elements. Let T(n) be the number of comparisons required to sort array of n elements. Then T(n)<=?
Which of the following accesses the seventh element stored in array? ; b) array; c) array(7); d) array;
Which of the following gives the memory address of the first element in array? ; b) array; c) array(2); d) array;
Which of the following is a two-dimensional array? b) int array c) int array d) char array
What will the following script output?
$array = array (1, 2, 3, 5, 8, 13, 21, 34, 55);
$sum = 0;
for ($i = 0; $i $sum += $array[$array[$i
An array consists of n elements. We want to create a heap using the elements. The time complexity of building a heap will be in order of
The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?