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

Algorithm that counts number of nodes in a linked list, Q. Write an algorit...

Q. Write an algorithm that counts number of nodes in a linked list.                                       A n s . Algo rithm to Count No. of Nodes in Linked List C

Write down any four applications of queues, Write down any four application...

Write down any four applications of queues.            Application of Queue (i)  Queue is used in time sharing system in which programs with the similar priority form a queu

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

Merge sort, #question. merging 4 sorted files containing 50,10,25,15 record...

#question. merging 4 sorted files containing 50,10,25,15 records will take time?

Random searching, write aprogram for random -search to implement if a[i]=x;...

write aprogram for random -search to implement if a[i]=x;then terminate other wise continue the search by picking new randon inex into a

Binary tree and binarytree parts, Q. What do you understand by the term Bin...

Q. What do you understand by the term Binary Tree? What is the maximum number of nodes which are possible in a Binary Tree of depth d. Explain the terms given below with respect to

Explain space complexity, Explain Space Complexity Space Complexity :...

Explain Space Complexity Space Complexity :- The space complexity of an algorithm is the amount of memory it requires to run to completion. Some of the reasons to study space

Logical database design, 1. For the ER diagram you created in assignment, t...

1. For the ER diagram you created in assignment, the artefact of the conceptual database design, map the ER model into the relational model according to how it was designed in the

Circular doubly link list, what is circular doubly link list?write down the...

what is circular doubly link list?write down the algorithm for insertion of elements in circular doubly link list

In order post order, illlustraate the construction of tree of a binary tree...

illlustraate the construction of tree of a binary tree given its in order and post order transversal

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