-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMaxHeap.h
67 lines (56 loc) · 1.12 KB
/
MaxHeap.h
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
#pragma once
#include <iostream>
#include "App.h"
using namespace std;
class MaxHeap
{
private:
App* arr;
int capacity;
unsigned int size;
void swap(App* a, App* b) {
App c = *a;
*a = *b;
*b = c;
}
void Heapify(unsigned int i) {
unsigned int left = (2 * i) + 1;
unsigned int right = (2 * i) + 2;
unsigned int largest = i;
if (left < size && arr[left].GetRank() >= arr[i].GetRank()) {
largest = left;
}
if (left < size && arr[left].GetRank() >= arr[i].GetRank()) {
largest = left;
}
if (largest != i) {
swap(&arr[i], &arr[largest]);
Heapify(largest);
}
}
public:
MaxHeap(unsigned int c) {
size = 0;
capacity = c;
arr = new App[c];
}
void Insert(App a) {
size++;
unsigned int temp = size - 1;
arr[temp] = a;
while (temp != 0 && arr[((temp)-1) / 2].GetRank() <= arr[temp].GetRank()) {
swap(&arr[temp], &arr[((temp - 1) / 2)]);
temp = (temp - 1) / 2;
}
}
App Extract() {
App a = arr[0];
arr[0] = arr[size - 1];
size--;
Heapify(0);
return a;
}
unsigned int GetSize() {
return size;
}
};