Array
closed

closed by
414 views
1 votes
1 votes
closed with the note: duplicate of https://gateoverflow.in/62056/complexity2

An array is of size n. Find the time complexity to insert a new value before an element e in the array?

(A) O(N)

(B) O(log N)

(C) O(1)

(D) O(N2)

closed by

Related questions

0 votes
0 votes
1 answer
2
iarnav asked Jun 12, 2018
840 views
Given an sorted array in descending order, what will be the time complexity to delete the minimum element from this array?
0 votes
0 votes
3 answers
4
Subham Nagar asked Mar 20, 2018
1,185 views
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$...