-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy patharray.c
224 lines (204 loc) · 4.08 KB
/
array.c
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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
//THAYCACAC
#include <stdio.h>
#include <math.h>
//NHAP MANG
void input(int n, int a[]){
for(int i=0; i<n; i++){
printf("a[%d] = ",i);
scanf("%d",&a[i]);
}
}
//XUAT MANG
void display(int n, int a[]){
for(int i=0; i<n; i++){
printf("%-5d",a[i]);
}
}
//TIM KIEM MOT PHAN TU TRONG MANG
void search(int n, int a[], int &x){
int check=1;
printf("Enter x = ");
scanf("%d", &x);
for(int i=0; i<n; i++){
if(a[i]==x){
printf("Tim duoc gia tri %d tai vi tri %d\n",x,i);
check=0;
}
}
if(check==1){
printf("Khong tim thay phan tu %d trong mang",x);
}
}
//KIEM TRA TINH CHAT CUA MANG (Co toan so duong hay khong)
void check(int n, int a[]){
int check=1;
for(int i=0; i<n; i++){
if(a[i]<0){
check=0; break;
}
}
if(check==1)
printf("True");
if (check==0)
printf("False");
}
//TACH MANG VI TRI BAT KY
void separate(int n, int a[], int &position){
printf("Enter position = ");
scanf("%d",&position);
printf("Array 1: ");
display(position, a);
int j=0;
for(int i=position; i<n; i++){
a[j++]=a[i];
}
printf("\nArray 2: ");
display(n-position,a);
}
//TACH THANH HAI MANG AM VA DUONG
void separateSign(int n, int a[], int &j, int negative[]){
j=0;
for(int i=0; i<n; i++){
if(a[i]<0){
negative[j++]=a[i];
}
}
display(j,negative);
}
//GOP MANG
void addArray(int &n, int a[], int j, int negative[]){
n+=j;
int n1=n;
for(int i=j; i>=0; i--)
a[n1--]=negative[i];
printf("\n");
display(n,a);
}
//TIM GIA TRI LON NHAT TRONG MANG
void max(int n, int a[]){
int max=a[0];
for(int i=1; i<n; i++)
if(a[i]>max)
max=a[i];
printf("Max = %d",max);
}
//TIM GIA TRI NHO NHAT
void min(int n, int a[]){
int min=a[0];
for(int i=1; i<n; i++)
if(a[i]<min)
min=a[i];
printf("Min = %d",min);
}
//SAP XEP MANG TANG DAN
swap(int &a, int &b){
int temp;
temp=a;
a=b;
b=temp;
}
void increase(int n, int a[]){
for(int i=0; i<n; i++)
for(int j=i+1; j<n; j++)
if(a[i]>a[j])
swap(a[i],a[j]);
display(n,a);
}
//SAP XEP MANG GIAM DAN
void decrease(int n, int a[]){
for(int i=0; i<n; i++)
for(int j=i+1; j<n; j++)
if(a[i]<a[j])
swap(a[i],a[j]);
display(n,a);
}
//SAP XEP 5 PHAN TU DAU TIEN
void increase5First(int n, int a[]){
for(int i=0; i<5; i++)
for(int j=i+1; j<5; j++)
if(a[i]>a[j])
swap(a[i],a[j]);
display(n,a);
}
//SAP XEP 5 PHAN TU CUOI CUNG
void increase5last(int n, int a[]){
for(int i=n-6; i<n; i++)
for(int j=i+1; j<n; j++)
if(a[i]>a[j])
swap(a[i],a[j]);
display(n,a);
}
//THEM MOT PHAN TU VAO MANG
void add(int &n, int a[], int &position, int &x){
printf("Enter position = ");
scanf("%d",&position);
printf("Enter value add = ");
scanf("%d",&x);
n+=1;
for(int i=n; i>position; i--){
a[i]=a[i-1];
}
a[position]=x;
display(n,a);
}
//XOA MOT PHAN TU TRONG MANG
void erase(int &n, int a[], int &position){
printf("Enter position = ");
scanf("%d",&position);
for(int i=position; i<n-1; i++){
a[i]=a[i+1];
}
display(--n,a);
}
//SUA MOT PHAN TU TRONG MANG
void edit(int n, int a[], int &position, int &x){
printf("Enter position = ");
scanf("%d", &position);
printf("Enter x = ");
scanf("%d",&x);
a[position]=x;
display(n,a);
}
//HAM KIEM TRA SO NGUYEN TO
int isPrime(int n){
if(n<2) return 0;
for(int i=2; i<=sqrt(n); i++){
if(n%i==0) return 0;
}
return 1;
}
//XOA PHAN TU TRUOC SO NGUYEN TO THU 2
void advance(int n, int a[]){
int count=0;
for(int i=0; i<n; i++){
if(isPrime(a[i])==1) count++;
if(count==2) {
for(int j=i-1; j<n; j++){
a[j]=a[j+1];
}
break;
}
}
display(--n,a);
}
int main(){
int n,x,position,j;
int a[100], negative[100];
printf("Enter n = ");
scanf("%d",&n);
input(n,a);
// search(n,a,x);
// check(n,a);
// separateSign(n,a,j,negative);
// addArray(n,a,j,negative);
// max(n,a);
// min(n,a);
// increase(n,a);
// decrease(n,a);
// add(n,a,position,x);
// erase(n,a,position);
// edit(n,a,position,x);
// increase5First(n,a);
// increase5last(n,a);
// advance(n,a);
}