True or False For each statement below, indicate whether you think it is True or False. If you like, you can provide a description of your answer. 5) Inserting elements into a sorted array is O(n) because you have to find the location to add the new element and then shift the remaining elements 6) If the sorted array gets too large, the performance of binary search becomes O(n) 7) For the delete algorithm, after you find the element to delete, you can make the algorithm run faster by replacing it with the last element in the array 8) If you used binary search to find the element to delete, the performance is still O(n) because you may have to shift all elements
True or False
For each statement below, indicate whether you think it is True or False. If you like, you can provide a description of your answer.
5) Inserting elements into a sorted array is O(n) because you have to find the location to add the new element and then shift the remaining elements
6) If the sorted array gets too large, the performance of binary search becomes O(n)
7) For the delete
8) If you used binary search to find the element to delete, the performance is still O(n) because you may have to shift all elements
Note : Since the question is multiple one. We are advised to do only first question. Kindly post other questions as new Question.
Question 5:
The insertion and deletion of elements in a sorted array executes at O(n), because we have to shift all the elements following the element to be inserted or deleted. The first element of array forms the sorted subarray while the others left form unsorted subarray from which we choose an element one by one and "insert" the same in the sorted subarray. Unless we reach the end of array the same steps are followed.
Step by step
Solved in 2 steps
