-
Notifications
You must be signed in to change notification settings - Fork 0
/
SortedArrayPQ.java
150 lines (134 loc) · 2.86 KB
/
SortedArrayPQ.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
package PriorityQueues;
import PriorityQueues.UnSortedArrayPQ.Array;
public class SortedArrayPQ implements PriorityQueue {
SArray[] arr;
int index,min;
SortedArrayPQ()
{
arr = new SArray[1];
index = 0;
}
class SArray{
String V;
int K;
String getVal() {return V;}
int getKey() {return K;}
}
@Override
public int size() {
return this.arr.length;
}
@Override
public boolean isEmpty() {
return this.arr[0] == null;
}
@Override
public double findMin() {
return this.arr[0].K;
}
@Override
public void insert(String V, int K) {
try {
this.arr[index] = new SArray();
if(index==0)
{
this.arr[index].K = K;
this.arr[index].V = V;
min = K;
}
else {
if(K<min)
{
this.arr[index].K = this.arr[index-1].K;
this.arr[index].V = this.arr[index-1].V;
this.arr[index-1].K = K;
this.arr[index-1].V = V;
min = K;
}
else if(K>this.arr[index-1].K)
{
this.arr[index].K = K;
this.arr[index].V = V;
}
else {
for(int i=index-1;i>=0;i--)
{
if(K>=this.arr[i].K)
{
for(int j=index;j>i;j--)
{
this.arr[j].K = this.arr[j-1].K;
this.arr[j].V = this.arr[j-1].V;
}
this.arr[i].K = K;
this.arr[i].V = V;
break;
}
}
}
}
++index;
if(index>=this.arr.length)
{
int newsize = this.arr.length+this.arr.length;
SArray[] newArr = new SArray[newsize];
SArray[] temp = this.arr;
this.arr = newArr;
for(int i=0; i<temp.length;i++)
{
this.arr[i] = new SArray();
this.arr[i] = temp[i];
}
}
}catch(Exception e)
{
System.out.println("Exception: "+e.getMessage());
}
}
@Override
public boolean removeMin() {
for(int i=1;i<index;i++)
{
this.arr[i-1] = this.arr[i];
}
this.arr[index-1] = null;
float percentfill = ((float)index/(float)this.arr.length)*100;
if(percentfill<=25.0)
{
int newsize = arr.length - arr.length/2;
SArray[] newArr = new SArray[newsize];
SArray[] temp = this.arr;
this.arr = newArr;
for(int i=0; i<index;i++)
{
this.arr[i] = new SArray();
this.arr[i] = temp[i];
}
}
index--;
return this.arr[index-1] == null;
}
@SuppressWarnings("null")
SArray[] sortArr(SArray[] ar, int size)
{
SArray[] temp = null;
for(int i=0; i < size; i++){
for(int j=1; j < (size-i); j++){
if(ar[j-1].K > ar[j].K){
//swap elements
temp[j] = ar[j-1];
ar[j-1] = ar[j];
ar[j] = temp[j];
}
}
}
return ar;
}
void printArray()
{
for (int i=0;i<index;i++)
{
System.out.println(i + ": "+this.arr[i].V+":"+this.arr[i].K);
}
}
}