MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / insertion

Function insertion

Arrays/32_Operations_on_arrays.c:59–162  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

57}
58
59int insertion()
60{
61 int element, index, choice;
62 int beginning()
63 {
64 printf("Enter element to insert at the beginnning\n");
65 scanf("%d", &element);
66 if (a1.counter>0)
67 {
68 for (int i = a1.counter; i >=0 ; i--)
69 {
70 a1.array1[i] = a1.array1[i-1];
71 }
72 }
73 a1.array1[0] = element;
74 a1.counter++;
75 printArr();
76 }
77 int atIndex()
78 {
79 printf("Enter the index: ");
80 scanf("%d", &index);
81 if (index<=a1.counter)
82 {
83 printf("Enter element to insert at the index:%d\n", index);
84 scanf("%d", &element);
85
86 for (int i = a1.counter; i > index; i--)
87 {
88 a1.array1[i] = a1.array1[i-1];
89 }
90 a1.array1[index] = element;
91 a1.counter++;
92 printArr();
93 }
94 // checks
95 else
96 {
97 printf("Please enter correct index");
98 }
99
100 }
101 int end()
102 {
103 printf("Enter element to insert at the end\n");
104 scanf("%d", &element);
105 a1.array1[a1.counter] = element;
106 a1.counter++;
107 printArr();
108 }
109insertOneCheckpoint:
110 switch (a1.counter)
111 {
112 case 0:
113 beginning();
114 break;
115
116 case 2 ... 9:

Callers 1

mainFunction · 0.70

Calls 3

beginningFunction · 0.85
endFunction · 0.85
atIndexFunction · 0.85

Tested by

no test coverage detected