Insertion of an element in a linear array, Data Structure & Algorithms

Assignment Help:

To delete an element in the list at the end, we can delete it without any difficult. But, assume if we desire to delete the element at the straining or middle of the list, then, we ought to rewrite all the elements after the position where the element that ought to be deleted exists. We ought to shift (r+1)th element to rthposition , where 'r' refer for position of deleted element in the list, the (r + 2)th element to (r + 1)th position,  and it will continue till the (n)th element to ( n-1 )th position, where n refer to the number of elements in the list, and after that the count is decremented.

From the above instance, if we desire to delete an element '44' from the list. We ought to shift 55 to the 4th position, 66 to the 5th position, and 77 to the 6th position.

Before deletion

 

Count  1      2         3               4         5           6            7

11

22

33

44

55

66

77

 

Step 1

Count     1       2            3       4               5           6            7

11

22

33

55

55

66

77

 

Step 2

Count     1     2            3          4           5             6            7

11

22

33

55

66

66

77

 

Step 3

Count     1        2         3          4             5            6

11

22

33

55

66

77

 

 


Related Discussions:- Insertion of an element in a linear array

Compound interest, Write the algorithm for compound interest

Write the algorithm for compound interest

Define game trees, Game trees An interesting application of trees is th...

Game trees An interesting application of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can picture the sequence of possible moves by m

Explain backtracking, Explain Backtracking The  principal idea is to co...

Explain Backtracking The  principal idea is to construct solutions single component  at a time  and evaluate such  partially constructed candidates as follows. If a partiall

Binary tree with depth 3, Q. Construct a complete binary tree with depth 3 ...

Q. Construct a complete binary tree with depth 3 for this tree which is maintained in the memory using the linked representation. Make the adjacency list and adjacency matrix for t

Deletion of an element from the linear array, Program will demonstrate dele...

Program will demonstrate deletion of an element from the linear array /* declaration of delete_list function */ voiddelete_list(list *, int); /* definition of delete_list

Prims algorithm, how to implement prims algorithm dynamically

how to implement prims algorithm dynamically

Advanced data structures - splay trees, This is a unit of which targeted on...

This is a unit of which targeted on the emerging data structures. Red- Black trees, Splay trees, AA-trees & Treaps are introduced. The learner must explore the possibilities of app

Sorting algorithm is best if the list is already sorted, Which sorting algo...

Which sorting algorithm is best if the list is already sorted? Why? Insertion sort as there is no movement of data if the list is already sorted and complexity is of the order

Name the four data type groups, There are four data type groups:  I...

There are four data type groups:  Integer kepts whole numbers and signed numbers Floating-point Stores real numbers (fractional values). Perfect for storing bank deposit

Doubly linked lists-implementation, In any singly linked list, each of the ...

In any singly linked list, each of the elements contains a pointer to the next element. We have illustrated this before. In single linked list, traversing is probable only in one d

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd