True or False For each statement below, indicate whether you think it is True or False 1) If you have an array with no “holes”, the append function performs at O(1) 2) Inserting an element at the front and shifting all elements performs significantly worse than appending an element at the end of the list 3) For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element 4) Binary search can be used on an unsorted array to significantly improve its performance from O(n) to O(1) 5) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario 6) If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) 7) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)
True or False
For each statement below, indicate whether you think it is True or False
1) If you have an array with no “holes”, the append function performs at O(1)
2) Inserting an element at the front and shifting all elements performs significantly worse than appending an element at the end of the list
3) For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element
4) Binary search can be used on an unsorted array to significantly improve its performance from O(n) to O(1)
5) Because the update
6) If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n)
7) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
