-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathHighArray.java
More file actions
106 lines (96 loc) · 2.66 KB
/
HighArray.java
File metadata and controls
106 lines (96 loc) · 2.66 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
package question.array;
public class HighArray {
private long[] a; // ref to array a
private int nElems; // number of data items
// -----------------------------------------------------------
public HighArray(int max) // constructor
{
a = new long[max]; // create the array
nElems = 0; // no items yet
}
// -----------------------------------------------------------
public boolean find(long searchKey) { // find specified value
int j;
for (j = 0; j < nElems; j++)
// for each element,
if (a[j] == searchKey) // found item?
break; // exit loop before end
if (j == nElems) // gone to end?
return false; // yes, can¡¯t find it
else
return true; // no, found it
} // end find()
// -----------------------------------------------------------
public void insert(long value) // put element into array
{
a[nElems] = value; // insert it
nElems++; // increment size
}
// -----------------------------------------------------------
public boolean delete(long value) {
int j;
for (j = 0; j < nElems; j++)
// look for it
if (value == a[j])
break;
if (j == nElems) // can¡¯t find it
return false;
else // found it
{
for (int k = j; k < nElems; k++)
// move higher ones down
a[k] = a[k + 1];
nElems--; // decrement size
return true;
}
} // end delete()
// -----------------------------------------------------------
public void display() // displays array contents
{
for (int j = 0; j < nElems; j++)
// for each element,
System.out.print(a[j] + " "); // display it
System.out.println("");
}
// ------------------------------------------------------------
public long getMax() {
if (nElems == 0) {
return -1;
} else {
long result = a[0];
for (int i = 0; i < nElems; i++) {
if (a[i] > result) {
result = a[i];
}
}
return result;
}
}
// -----------------------------------------------------------
public static void main(String[] args) {
int maxSize = 100; // array size
HighArray arr; // reference to array
arr = new HighArray(maxSize); // create the array
arr.insert(77); // insert 10 items
arr.insert(99);
arr.insert(44);
arr.insert(55);
arr.insert(22);
arr.insert(88);
arr.insert(11);
arr.insert(00);
arr.insert(66);
arr.insert(33);
arr.display(); // display items
int searchKey = 35; // search for item
if (arr.find(searchKey))
System.out.println("Found " + searchKey);
else
System.out.println("Can¡¯t find " + searchKey);
arr.delete(00); // delete 3 items
arr.delete(55);
arr.delete(99);
arr.display(); // display items again
} // end main()
} // end class HighArray
// //////////////////////////////////////////////////////////////