Describe how one can implement each of the following operations on an array so that the time it takes does not depend on the array’s size n.
a. Delete the ith element of an array (1≤ i ≤ n).
b. Delete the ith element of a sorted array (the remaining array has to stay sorted, of course).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.