MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized
→
What is the worst case time complexity of inserti...
1.
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(n2)
Answer» D. O(n2)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the worst case time complexity of inserting an element into the sorted array?
Which of the following is not an application of sorted array?
To search for an element in a sorted array, which searching technique can be used?
Which of the following is an advantage of parallel arrays?
Which of the following is a disadvantage of parallel array over the traditional arrays?
What is a sorted array?
What are some of the disadvantages of parallel arrays?
What are the advantages of parallel arrays over the traditional arrays?
What are parallel arrays?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies