-
Notifications
You must be signed in to change notification settings - Fork 0
/
heap_sort.cpp
70 lines (70 loc) · 1.42 KB
/
heap_sort.cpp
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
#include <stdio.h>
#include <stdlib.h>
struct int_Heap
{
int *heap,heap_sz;
const int inf = 2147483647;
void init(int n)
{
if(heap!=NULL)
free(heap);
heap = (int *)malloc(sizeof(int)*(2*n+10));
for(int i=0;i<(2*n+10);i++)
heap[i] = inf;
heap_sz = 0;
}
void push(int x)
{
int cur = heap_sz;
heap[heap_sz] = x;
while(cur)
{
int parent = ((cur-1)>>1);
if(heap[parent] <= heap[cur])
break;
swap(parent,cur);
cur = parent;
}
heap_sz++;
}
int top()
{
return heap[0];
}
void pop()
{
int cur = 0;
if(heap_sz == 0)
return;
heap_sz--;
heap[0] = heap[heap_sz]; heap[heap_sz] = inf;
while(1)
{
int ch = ((heap[2*cur+1] <= heap[2*cur+2])?2*cur+1:2*cur+2);
if(heap[cur] <= heap[ch])
break;
swap(cur,ch);
cur = ch;
}
}
void swap(int lo1,int lo2)
{
int temp = heap[lo1];
heap[lo1] = heap[lo2];
heap[lo2] = temp;
}
};
typedef struct int_Heap int_Heap;
int_Heap h;
int main(void)
{
int n,a; scanf("%d",&n); h.init(n);
for(int i=0;i<n;i++)
{
scanf("%d",&a); h.push(a);
}
for(int i=0;i<n;i++)
{
printf("%d\n",h.top()); h.pop();
}
}