-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathArrayExample.java
330 lines (305 loc) · 5.64 KB
/
ArrayExample.java
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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
import java.util.Scanner;
public class ArrayExample
{
private int arr[];
private int size;
Scanner sc=new Scanner(System.in);
public void store()
{
System.out.print("\nEnter size of array:");
size=sc.nextInt();
arr=new int[size];
for(int i=0;i<arr.length;i++)
{
System.out.println("Enter element for index #"+i);
arr[i]=sc.nextInt();
}
set();
}
public void show()
{
System.out.println();
for(int i:arr)
{
System.out.print(i+"\t");
}
set();
}
public void sort()
{
int a[]=new int[size];
for(int i=0;i<arr.length;i++)
{
a[i]=arr[i];
}
System.out.println("Enter 1 for ascending order\nEnter 2 for descending order\n:");
int select=sc.nextInt();
if(select==1)
{
for(int i=1;i<a.length;i++)
{
for(int j=i;j>0 && a[j]<a[j-1];j--)
{
int temp;
temp = a[j];
a[j] = a[j-1];
a[j-1] = temp;
}
}
}
if(select==2)
{
for(int i=1;i<a.length;i++)
{
for(int j=i;j>0 && a[j]>a[j-1];j--)
{
int temp;
temp = a[j];
a[j] = a[j-1];
a[j-1] = temp;
}
}
}
System.out.println("\nThe sorted order is\n");
for(int i: a)
{
System.out.print(i+"\t");
}
System.out.println();
set();
}
public void countFrequency()
{
int i=0,count=0,flag=0;
while(i<size)
{
for(int j=0;j<arr.length;j++)
{
if(arr[i]==arr[j])
count++;
}
if(count>1)
System.out.println("\nThe number"+arr[i]+" repeats "+count+" number of times\n");
else
System.out.println("\nThe number"+arr[i]+" repeats "+count+" number of time\n");
count=0;
i++;
}
set();
}
public void reverse()
{
int a[]=new int[size];
for(int i=arr.length-1;i>=0 ;i--)
{
a[arr.length-1-i]=arr[i];
}
for(int k:a)
{
System.out.print(k+"\t");
}
set();
}
public void getMaxMin()
{
int max=arr[0];
int min=arr[0];
for(int i=0;i<arr.length;i++)
{
if(arr[i]>max)
max=arr[i];
if(arr[i]<min)
min=arr[i];
}
System.out.println("\nThe largest element is "+max+" while the smallest is "+min);
set();
}
public void getMaxMinV2()
{
int a[]=new int[size];
for(int i=0;i<arr.length;i++)
{
a[i]=arr[i];
}
for(int i=1;i<a.length;i++)
{
for(int j=i;j>0 && a[j]<a[j-1];j--)
{
int temp;
temp = a[j];
a[j] = a[j-1];
a[j-1] = temp;
}
}
int max2=a[size-1];
int min2=a[0];
for(int i=0;i<a.length;i++)
{
if(a[i]<=min2)
{
}
else
{
min2=a[i];
break;
}
}
for(int i=a.length-1;i>=0;i--)
{
if(a[i]>=max2)
{
}
else
{
max2=a[i];
break;
}
}
System.out.println("\nThe second largest element is "+max2+" while the second smallest element is "+min2+"\n");
set();
}
public void getFirstIndex()
{
System.out.print("\nEnter the number whose index you want :");
int want=sc.nextInt();
int found=0;
for(int i=0;i<arr.length;i++)
{
if(arr[i]==want)
{
found=i;
break;
}
}
System.out.println("\nThe first index of "+want+" is "+found+"\n");
set();
}
public void getLastIndex()
{
System.out.print("\nEnter the number whose index you want :");
int want=sc.nextInt();
int found=0;
for(int i=0;i<arr.length;i++)
{
if(arr[i]==want)
{
found=i;
}
}
System.out.println("\nThe last index of "+want+" is "+found+"\n");
set();
}
public void getAllIndex()
{
System.out.print("\nEnter the number whose index you want :");
int want=sc.nextInt();
int found=0;
System.out.println("\nThe index's of the given number are\n");
for(int i=0;i<arr.length;i++)
{
if(arr[i]==want)
{
found=i;
System.out.print(found+"\t");
}
}
System.out.println();
set();
}
public void subArray()
{
int sp, ep;
System.out.print("\nEnter the starting index:");
sp=sc.nextInt();
System.out.print("Enter the ending index:");
ep=sc.nextInt();
int sze=ep-sp+1;
int a[]=new int[sze];
for(int i=sp;i<=ep;i++)
{
a[i-sp]=arr[i];
}
System.out.print("\nThe sub array is\n");
for(int i:a)
{
System.out.print(i+"\t");
}
System.out.println();
set();
}
public void set()
{
Scanner s=new Scanner(System.in);
int select;
System.out.print("Enter 1 to store in array\nEnter 2 to show array\nEnter 3 to sort the array\nEnter 4 to count frequency of a given number\nEnter 5 to reverse the array\nEnter 6 to get maximum and minimum element\nEnter 7 to get second maximum and minimum element in the array\nEnter 8 to get first index of a given number\nEnter 9 to get the last index of a given number\nEnter 10 to get all index's of a given number\nEnter 11 to get a subarray\nEnter any other number to exit\n:");
select=s.nextInt();
switch(select)
{
case 1:
{
store();
break;
}
case 2:
{
show();
break;
}
case 3:
{
sort();
break;
}
case 4:
{
countFrequency();
break;
}
case 5:
{
reverse();
break;
}
case 6:
{
getMaxMin();
break;
}
case 7:
{
getMaxMinV2();
break;
}
case 8:
{
getFirstIndex();
break;
}
case 9:
{
getLastIndex();
break;
}
case 10:
{
getAllIndex();
break;
}
case 11:
{
subArray();
break;
}
default:
System.exit(0);
}
}
}
class TestArray
{
public static void main(String... args)
{
ArrayExample a=new ArrayExample();
a.set();
}
}