-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathheap_sort.c
131 lines (111 loc) · 2.07 KB
/
heap_sort.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
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
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
int g_heapsize;
int heap_left(int parent)
{
int left = 0;
if(parent <= g_heapsize/2)
{
left = parent*2;
}
return left;
}
int heap_right(int parent)
{
int right = 0;
if(parent <= g_heapsize/2)
{
right = parent*2 + 1;
if(right>g_heapsize)
{
right = 0;
}
}
return right;
}
void heap_exchange(int array[], int i, int j)
{
int tmp;
assert(NULL != array);
tmp = array[i];
array[i] = array[j];
array[j] = tmp;
return;
}
void heap_max_ify(int array[], int index)
{
int left, right, largest;
assert(NULL != array);
if(index > g_heapsize/2)
{
return;
}
left = heap_left(index);
right = heap_right(index);
largest = index;
if(array[index] < array[left])
{
largest = left;
}
if(array[largest] < array[right])
{
largest = right;
}
if(largest != index)
{
heap_exchange(array, index, largest);
heap_max_ify(array, largest);
}
return;
}
void heap_build(int array[])
{
int index;
assert(NULL != array);
for(index=g_heapsize/2; index>0; index--)
{
heap_max_ify(array, index);
}
return;
}
void heap_sort(int array[], int size)
{
int index;
assert(NULL != array);
g_heapsize = size;
heap_build(array);
for(index=size; index>1; index--)
{
heap_exchange(array, index, 1);
g_heapsize--;
heap_max_ify(array, 1);
}
return;
}
int main(int argc, char *argv[])
{
int index;
int *array;
assert(1 < argc);
array = malloc(sizeof(int) * argc);
if(NULL == array)
{
return 0;
}
array[0] = 0;
for(index=1; index<argc; index++)
{
array[index] = atoi(argv[index]);
printf("%d ", array[index]);
}
printf("\n");
heap_sort(array, argc-1);
printf("the result is:\n");
for(index=1; index<argc; index++)
{
printf("%d ", array[index]);
}
printf("\n");
return 0;
}