常见排序之堆排序

#include<stdio.h>
#include<stdlib.h>

void swap(int *array,int a,int b)
{
int temp;

temp = array[a];
array[a] = array[b];
array[b] = temp;
}

void heap_adjust(int *array,int s,int m)
{
int temp,j;

temp = array[s];

for(j = 2*s; j <=m; j *=2)
{
if(j < m && array[j] < array[j+1])
{
++j;
}

if(temp >= array[j])
{
break;
}

array[s] = array[j];
s = j;
}
array[s] = temp;
}

void heap_sort(int *array,int length)
{
int i,j;

for(i = length/2; i >= 0; i--)
{
heap_adjust(array,i,length);
}

for(j = length-1; j > 0; j--)
{
swap(array,0,j);
heap_adjust(array,0,j-1);
}
}

int main(void)
{
int i;
int array_sort[15] = {14,42,100,50,16,17,3,9,8,60,7,6,4,2,1};

heap_sort(array_sort,15);

for(i = 0; i < 15; i++)
{
printf("%d\t",array_sort[i]);
}
printf("\r\n");

return 0;
}

常见排序之堆排序

原文：https://www.cnblogs.com/muzixiaofeng/p/10088625.html