-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patharr.cpp
More file actions
144 lines (103 loc) · 2.83 KB
/
Copy patharr.cpp
File metadata and controls
144 lines (103 loc) · 2.83 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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
//WAP TO PRINT THE FOLLOWING ACTIONS ON ARRAY::
/* 1. PRINT THE EVEN VALUED ELEMENTS.
2. PRINT THE ODD VALUED ELEMENTS.
3. CALCULATE & PRINT THE SUM & AVERAGE OF ELEMNTS IN AN ARRAY.
4. PRINT THE MAXXIMUM AND MINIMUM ELEMENTS IN ARRAY.
5. REMOVES THE DUPLICATES ELEMENTS FROM ARRAY.
6. PRINT THE ARRAY IN REVERSE ORDER.
*/
#include<iostream>
using namespace std;
int main()
{
int i,j,sum=0, n;
int k;
int max=0;
float avg=0;
cout<<"\n ENTER THE NUMBER OF ELEMENTS-"<<endl;
cin>>n;
int arr[n];
int min=arr[0];
for(i=0; i<n; i++)
{
cout<<"\nENTER THE "<<i<<" ELEMENT--"<<endl;
cin>>arr[i];
}
cout<<"\nGIVEN ARRAY IS----arr["<<n<<"] = {";
for(i=0; i<n; i++)
{
cout<<arr[i]<<" ";
}
cout<<"}"<<endl;
//PRINTING THE EVEN VALUED ELEMENTS....
cout<<"\nEVEN ELEMENTS IN THIS ARRAY ARE---{ ";
for(i=0; i<n; i++)
{
if(arr[i]% 2==0)
{
cout<<arr[i]<<" ";
}
} cout<<"}"<<endl;
//PRINTING THE ODD VALUED ELEMENTS...
cout<<"\nODD ELEMENTS IN THIS ARRAY ARE---{ ";
for(i=0; i<n; i++)
{
if(arr[i]% 2!=0)
{
cout<<arr[i]<<" ";
}
} cout<<"}"<<endl;
//CALCULATING & PRINT THE SUM & AVERAGE OF ELEMNTS IN AN ARRAY............
for(i=0; i<n; i++)
{
sum = sum + arr[i];
}
cout<<"\n\nSUM OF THE ELEMENTS IN ARRAY IS---"<<sum;
avg= sum/n;
cout<<"\n\nAVERAGE OF THE ELEMNTS IS ---"<<avg;
//PRINTING THE MAXXIMUM AND MINIMUM ELEMENTS IN ARRAY...............
for(i=0; i<n; i++)
{
if(max<arr[i])
{
max = arr[i];
}
}
for(i=0; i<n; i++)
{
if (min>arr[i])
{
min = arr[i];
}
}
cout<<"\n\nMAXIMUM ELEMENT IN THE GIVEN ARRAY IS ---"<<max<<endl;
cout<<"\n\nMINIMUM ELEMENT IN THE GIVEN ARRAY IS ---"<<min<<endl;
//REMOVING THE DUPLICATES ELEMENTS OF THE ARRAY......
for(i=0; i<n; i++)
{
for(j=i+1; j<n; j++)
{
// If any duplicate found
if(arr[i] == arr[j])
{
//Delete the current duplicate element
for(int k=j; k<n; k++)
{
arr[k] = arr[k + 1];
}
// Decrement size after removing duplicate element
n--;
// If shifting of elements occur then don't increment j
j--;
}
}
}
// Print an array after deleting an element
cout<<" ARRAY AFTER DELETING DUPLICATES ELEMENT IS--{";
for(i=0; i<n; i++)
{
cout<<" "<<arr[i]<<" ";
}
cout<<"}"<<endl;
return 0;
}