adplus-dvertising
frame-decoration

Question

What is the worst case time complexity of inserting an element into the sorted array?

a.

O(nlogn)

b.

O(logn)

c.

O(n)

d.

O(n^2)

Answer: (c).O(n)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the worst case time complexity of inserting an element into the sorted array?

Similar Questions

Discover Related MCQs

Q. What is a sparse array?

Q. When do you use a sparse array?

Q. What is the difference between a normal(naive) array and a sparse array?

Q. Suppose the contents of an array A are, A = {1, null, null, null, null, 10};
What would be the size of the array considering it as a normal array and a sparse array?

Q. What is sparsity of a matrix?

Q. What are the advantages of sparse matrices over normal matrices?

Q. What is the order of a matrix?

Q. Which of the following property does not hold for matrix multiplication?

Q. How do you allocate a matrix using a single pointer in C?(r and c are the number of rows and columns respectively)

Q. If row-major order is used, how is the following matrix stored in memory?
a b c

d e f

g h i

Q. If column-major order is used, how is the following matrix stored in memory?
a b c

d e f

g h i

Q. Which of the following are the uses of matrices?

Q. What is the disadvantage of matrices?

Q. Matrix A when multiplied with Matrix C gives the Identity matrix I, what is C?

Q. A program P reads in 500 integers in the range [0..100] exepresenting the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies?

Q. Which of these best describes an array?

Q. Consider an array A[20, 10], assume 4 words per memory cell and the base address of array A is 100. What is the address of A[11, 5] ? Assume row major storage.

Q. Let A[1...n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A. What is the expected number of inversions in any permutation on n elements ?

Q. Which of the following operations is not O(1) for an array of sorted data. You may assume that array elements are distinct.

Q. The smallest element of an array's index is called its