UGCNET-DEC2016-II: 21

Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) Insertion-O(1), Deletion-O(1), Maximum-O(n), Minimum-O(n) Insertion-O(n), Deletion-O(n), Maximum-O(1), Minimum-O(1) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)
Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) Insertion-O(1), Deletion-O(1), Maximum-O(n), Minimum-O(n) Insertion-O(n), Deletion-O(n), Maximum-O(1), Minimum-O(1) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

asked
Feb 4, 2017
in Others
1.6k views