Insertion in list, Data Structure & Algorithms

Assignment Help:

In the array implementation of lists, elements are stored into continuous locations. In order to add an element into the list at the end, we can insert it without any problem. But, assume if we desire to add the element at the starting or middle of the list, then we ought to rewrite all the elements after the position where the element ought to be added. We ought to shift (n)th   element to (n+1)th position, where 'n' refer to number of elements in the list. The (n-1)thelement to (n)th position  and it will continue till the ( r ) thelement to ( r + 1 )th position, where 'r' refer to the position of insertion. For doing this, thecount will be incremented.

From the above instance, if we desire to add element '35' after element '33'. We ought to shift 77 to the 8th position, 66 to the 7th position, so on, 44 to the 5th position.

Before Insertion

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          8

11

22

33

44

55

66

77

77

Step 2

Count    1      2            3           4            5           6            7          8

11

22

33

44

55

66

66

77

Step 3

Count     1      2      3              4               5          6            7          8

11

22

33

44

55

55

66

77

 

Step 4

Count   1      2            3           4            5            6            7          8

11

22

33

44

44

55

66

77

Step 5

Count     1       2        3           4            5             6            7          8

11

22

33

35

44

55

66

77


Related Discussions:- Insertion in list

Procedures, what is far and near procedures in system programming?

what is far and near procedures in system programming?

Undirected graph and adjacency matrix, Q. Consider the specification writte...

Q. Consider the specification written below of a graph G V(G ) = {1,2,3,4} E(G ) = {(1,2), (1,3), (3,3), (3,4), (4,1)} (i)        Draw the undirected graph. (

Searching techniques, Searching is the procedure of looking for something. ...

Searching is the procedure of looking for something. Searching a list containing 100000 elements is not the similar as searching a list containing 10 elements. We discussed two sea

Graphs, c program to represent a graph as an adjacency multilist form

c program to represent a graph as an adjacency multilist form

Perfect matching polytope ppm, Let G=(V,E) be a graph for which all nodes h...

Let G=(V,E) be a graph for which all nodes have degree 5 and where G is 5-edge is connected. a) Show that the vector x which is indexed by the edges E and for which xe = 1/5 for

Grounded header link list and a circular header link list, What is the diff...

What is the difference between a grounded header link list and a circular header link list? A header linked list is a linked list which always having a special node, known as t

Illustrate the back face detection method, Illustrate the Back Face Detecti...

Illustrate the Back Face Detection Method A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space me

Interest, I =PR/12 Numbers of years .Interest rate up to 1yrs ...

I =PR/12 Numbers of years .Interest rate up to 1yrs . 5.50 up to 5yrs . 6.50 More than 5 yrs . 6.75 design an algorithm based on the above information

Binary search, In a sorted list, Binary search is carried out by dividing t...

In a sorted list, Binary search is carried out by dividing the list into two parts depends on the comparison of the key. Since the search interval halves each time, the iteration o

Push and pop operations, Q. Explain that how do we implement two stacks in ...

Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.

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