-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinHeap.cpp
More file actions
78 lines (68 loc) · 1.77 KB
/
BinHeap.cpp
File metadata and controls
78 lines (68 loc) · 1.77 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
#include <cassert>
#include "BinHeap.h"
template <class ElementValue>
BinHeapMin<ElementValue>::BinHeapMin(int maxSize):
capacity(maxSize),
numElems(0),
indexArray(0),
elements(new ElementValue[maxSize])
{}
template <class ElementValue>
void BinHeapMin<ElementValue>::bubbleUp(int i) {
assert(0 <= i && i < numElems);
if (i <= 0)
return;
int parent = (i - 1) / 2;
while (i > 0 && elements[i] < elements[parent]) {
swap(i, parent);
i = parent;
parent = (i - 1) / 2;
}
}
template <class ElementValue>
void BinHeapMin<ElementValue>::bubbleDown(int i) {
int s0 = 2*i + 1;
int s1 = s0 + 1;
int s = s0;
if (s1 < numElems && elements[s1] < elements[s])
s = s1;
while (s < numElems && elements[s] < elements[i]) {
swap(i, s);
i = s;
s0 = 2*i + 1;
s1 = s0 + 1;
s = s0;
if (s1 < numElems && elements[s1] < elements[s])
s = s1;
}
}
template <class ElementValue>
void BinHeapMin<ElementValue>::removeRoot() {
assert(numElems > 0);
elements[0] = elements[numElems - 1];
if (indexArray != 0) {
int ext = indexArray[numElems - 1];
indexArray[0] = ext;
if (heapIndex != 0)
heapIndex[ext] = 0;
}
--numElems;
bubbleDown(0);
}
template <class ElementValue>
void BinHeapMin<ElementValue>::orderHeap() { // Called for arbitrary contents
int k = numElems / 2;
while (k >= 0) {
bubbleDown(k);
--k;
}
}
template <class ElementValue>
BinHeapMin<ElementValue>::~BinHeapMin() {
delete[] elements;
}
// Provide explicit instantiations for
// necessary BinHeapMin classes
//... template class BinHeapMin<int>;
template class BinHeapMin<char>;
template class BinHeapMin<double>;