forked from Code-Recursion/DataStructuresAndAlgorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdelete_from_array.cpp
60 lines (48 loc) · 970 Bytes
/
delete_from_array.cpp
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
#include <iostream>
using namespace std;
struct Array
{
int *A;
int size;
int length;
};
void Display(struct Array Arr)
{
cout << endl
<< "Array : ";
for (int i = 0; i < Arr.length; i++)
cout << Arr.A[i] << " ";
cout << endl;
}
void Delete(struct Array *Arr, int index)
{
if (index >= 0 && index <= Arr->length)
for (int i = index; i < Arr->length; i++)
Arr->A[i] = Arr->A[i + 1];
Arr->length--;
}
int main()
{
struct Array Arr;
Arr.size = 10;
int n;
Arr.A = new int[Arr.size];
Arr.length = 0;
cout << "Enter len of array : ";
cin >> n;
Arr.length = n;
cout << endl
<< "Enter all Elements : ";
for (int i = 0; i < n; i++)
cin >> Arr.A[i];
Display(Arr);
int index;
cout << endl
<< "Enter index to delete : ";
cin >> index;
Delete(&Arr, index);
Display(Arr);
return 0;
}
// Best O(1)
// Worst O(n)