ＢＴＷ:发现自己智商有问题地说...
还是觉得原书
算法描述对某些输入还是有问题地说...-_-b#
<stdlib.h>#
<stdio.h>#
<time.h>#
MAX_LENGTH 100/*Show usage*/
void usage(char * prog)
{
pr
f(\"%s Usage:\\n\", prog);pr
f(\"%s <the count of numbers to sort (should be less than 100)>\\n\", prog);}
/*Generate and initialize the list*/
* generate_list( count){
i; * list;list = (
*)malloc(count*
());
(list 
NULL){
perror(\"malloc\");
NULL;}
/*Initialize the list with
egers less than 100*/srandom((unsigned
)time(NULL));for (i = 0; i < count ; i
)list[i] = random
%100; list;}
/*Show the list*/
void show_list(
* list, length){
i;for(i = 0; i < length; i
){
pr
f(\"%d \", list[i]);}
pr
f(\"\\n\");}
/*algorithm*/
void a_fix_heap(
* list, h_size, vac, k){
this_vac = vac;while((2*vac +1) < h_size)
{
(list[2*vac +1] < list[2*vac +2]){
list[vac] = list[2*vac +2];
vac = 2*vac +2;
}
{
list[vac] = list[2*vac +1];
vac = 2*vac +1;
}
}
((2*vac +1) h_size) /*If vacation is moved to a node with _disibledevent=> vac = 2*vac+1;}
}
while(k > list[(vac-1)/2] && (vac-1)/2 >= this_vac)
{
list[vac] = list[(vac-1)/2];
vac = (vac-1)/2;
(vac 0){
;}
}
list[vac] = k;
;}
void build_heap(
* list, length){
i;for(i = (length+1)/2; i >= 0; i --)
{
a_fix_heap(list, length, i, list[i]);
}
;}
void heap_sort(
* list, length){
i;build_heap(list, length - 1);
for(i = length -1; i >= 1; i --)
{
temp = list[i];list[i] = list[0];
a_fix_heap(list, i -1, 0, temp);
}
}
( argc, char * argv
){
length; * list = NULL;/*Deal with the arguments*/
(argc != 2){
usage(argv[0]);
exit(127);
}
length = atoi(argv[1]);
(!length || length > MAX_LENGTH){
usage(argv[0]);
exit(129);
}
list = generate_list(length);
(list NULL)exit(128);
{
pr
f(\"Soruce list:\\n\");show_list(list, length);
heap_sort(list, length);
pr
f(\"Ordered list:\\n\");show_list(list, length);
}
free(list);
1;}
最新评论