Скачать или смотреть Deletion Operation in Linear Array | Data Structure & Algorithm

Deletion in Array – at Beginning, Given Location and End of Linear Array

Deletion in Array- an element at the beginning of the array

In this case we have to move all the elements one position forward to fill the position of the element at the beginning of array. Though the deletion process is not difficult but moving all elements one position forward involve movement of all the existing elements except the one being deleted. This is the worst case scenario in deletion in a linear array.

Deletion in Array – an element at the end of the array

In this case we don’t have to move any elements since the action here will be just removing the last element. This is done by redefining the index of last element of linear array = N-1. This is the best case scenario in deletion in a linear array.

Deletion in Array – an element at the give position J

Let J be any location in the array for one existing element. We have to delete the element at J position. To do this starting from J every element is moved one place forward so that the element after index J comes to position of Jth element. This is the average case scenario in deletion in linear array.

Complexity of Deletion in Array Algorithm

complexity of this algorithm is O(n)