-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathadd element in array.cpp
More file actions
68 lines (51 loc) · 1.81 KB
/
add element in array.cpp
File metadata and controls
68 lines (51 loc) · 1.81 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#include<iostream>
using namespace std;
//-------------------------------------------------------------
// Function to insert 'x' at 'pos' in the array
void insertX(int &n, int arr[], int x, int pos)
{
for (int i = n; i >= pos; i--)
arr[i] = arr[i - 1];
arr[pos] = x;
n++; // Increase array size
}
//-------------------------------------------------------------
int main()
{
int arr[100];
int n;// Initial size = 10
cout<<"enter initial value of n :(max100):"<<endl;
cin>>n;
cout << "Enter "<<n<<" elements: ";
for (int i = 0; i < n; i++)
cin >> arr[i];
//---------------------------------------------------------------
// 2. Ask for insertion details (all in one phase)
int numInsert;
cout << "\nHow many insertions? ";
cin >> numInsert;
int positions[numInsert], values[numInsert];
cout << "Enter " << numInsert << " positions (0-" << n << "): ";
for (int i = 0; i < numInsert; i++)
cin >> positions[i];
cout << "Enter " << numInsert << " values to insert: ";
for (int i = 0; i < numInsert; i++)
cin >> values[i];
//------------------------------------------------------------------------
// 3. Perform insertions (from right to left to avoid overlapping shifts)
for (int i = numInsert - 1; i >= 0; i--)
{
if (positions[i] < 0 || positions[i] > n)
{
cout << "Skipping invalid position: " << positions[i] << endl;
continue;
}
insertX(n, arr, values[i], positions[i]);
}
//----------------------------------------------------------------------------
// 4. Display final array
cout << "\nFinal array: ";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
return 0;
}