-
Notifications
You must be signed in to change notification settings - Fork 0
/
practice7_6.c
79 lines (70 loc) · 1.56 KB
/
practice7_6.c
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
#include <stdio.h>
#include <stdlib.h>
#define MAX_ELEMENT 100
// 히프에 대한 1차원 배열과 히프 원소의 개수를 구조체로 묶어서 선언
typedef struct {
int heap[MAX_ELEMENT];
int heap_size;
} heapType;
// 공백 히프를 생성하는 연산
heapType* createHeap() {
heapType *h = (heapType*)malloc(sizeof(heapType));
h->heap_size = 0;
return h;
}
// 히프에 item을 삽입하는 연산
void insertHeap(heapType *h, int item) {
int i;
h->heap_size = h->heap_size + 1;
i = h->heap_size;
while ((i != 1) && (item > h->heap[i / 2])) {
h->heap[i] = h->heap[i / 2];
i /= 2;
}
h->heap[i] = item;
}
// 히프의 루트를 삭제하여 반환하는 연산
int deleteHeap(heapType *h) {
int parent, child;
int item, temp;
item = h->heap[1];
temp = h->heap[h->heap_size];
h->heap_size = h->heap_size - 1;
parent = 1;
child = 2;
while (child <= h->heap_size) {
if ((child < h->heap_size) && (h->heap[child]) < h->heap[child + 1])
child++;
if (temp >= h->heap[child]) break;
else {
h->heap[parent] = h->heap[child];
parent = child;
child = child * 2;
}
}
h->heap[parent] = temp;
return item;
}
// 1차원 배열 히프의 내용을 출력하는 연산
void printHeap(heapType *h) {
int i;
printf("Heap : ");
for (i = 1; i <= h->heap_size; i++)
printf("[%d] ", h->heap[i]);
}
void main() {
int i, n, item;
heapType *heap = createHeap();
insertHeap(heap, 10);
insertHeap(heap, 45);
insertHeap(heap, 19);
insertHeap(heap, 11);
insertHeap(heap, 96);
printHeap(heap);
n = heap->heap_size;
for (i = 1; i <= n; i++) {
item = deleteHeap(heap);
printf("\n delete : [%d] ", item);
}
getchar();
}