Department of Computer Science and Engineering (CSE)

INSERTION AND DELETION IN ARRAY

PREPARED BY: TARU BHATNAGAR

University Institute of Engineering (UIE)

 Department of Computer Science and Engineering (CSE)

OUTCOMES
Insertion Algorithm
Deletion Algorithm
Complexity discussion

University Institute of Engineering (UIE)

 Department of Computer Science and Engineering (CSE)

Insertion and deletion operations

Insert operation is to insert one or more data elements into an
array. Based on the requirement, a new element can be added at
the beginning, end, or any given index of array.

Deletion refers to removing an existing element from the array

and re-organizing all elements of an array

University Institute of Engineering (UIE)

 Department of Computer Science and Engineering (CSE)

INSERTION ALGORITHM
Let LA be a Linear Array (unordered) with N elements and K is a positive integer such
that K<=N. Following is the algorithm where ITEM is inserted into the Kth position of
LA . We are performing this operation with array having starting index 0. k position is
according to the user. For Ex if User Says 3, we have to insert at 3-1 i.e 2.

1.Start
2. Set J = N-1
3. Repeat steps 5 and 4 while J > K-1
4. Set LA[J] = LA[J-1]
5. Set J = J-1
6. Set LA[K-1] = ITEM
7. Stop

University Institute of Engineering (UIE)

 Department of Computer Science and Engineering (CSE)

DELETION ALGORITHM
Consider A is a linear array with N elements and K is a positive
integer such that K<=N. Following is the algorithm to delete an
element available at the Kth position of A.

1. Start
2. Set J = K
3. Repeat steps 4 and 5 while J < N
4. Set A[J] = A[J+1]
5. Set J = J+1
6. Set N = N-1
7. Stop

University Institute of Engineering (UIE)

 Department of Computer Science and Engineering (CSE)

COMPLEXITY ANALYSIS
O(1) accurately describes inserting at the end of the array. However, if
you're inserting into the middle of an array, you have to shift all the
elements after that element, so the complexity for insertion in that
case is O(n) for arrays. End appending also discounts the case where
you'd have to resize an array if it's full.

Delete----O(n) if we shift otherwise O(1) if last element.

University Institute of Engineering (UIE)

 Department of Computer Science and Engineering (CSE)

Queries??

University Institute of Engineering (UIE)