堆排序是一个性能很优的排序算法,一般借助数据结构——最大堆,来实现排序的效果,一般步骤为:建堆——排序,建堆和排序的过程中都夹杂着保持堆的稳定性。优先级队列也用到数据结构堆,主要C语言算法如下:
#include <stdio.h>
#include <limits.h>
//记录最大堆的长度
unsigned int heap_size = 0;
//下标从0开始
//求父节点的下标
unsigned int parent(unsigned int index)
{
return (index - 1) / 2;
}
//求左儿子节点的下标
unsigned int lchild(unsigned int index)
{
return 2 * index + 1;
}
//求右儿子节点的下标
unsigned int rchild(unsigned int index)
{
return 2 * index + 2;
}
//保持最大堆的有序性
void max_heapify(int *A, unsigned int i)
{
unsigned int l, r, largest;
int temp;
largest = i;
l = lchild(i);
r = rchild(i);
if (l < heap_size && A[l] > A[i])
{
largest = l;
}
if (r < heap_size && A[r] > A[largest])
{
largest = r;
}
if (i != largest)
{
temp = A[i];
A[i] = A[largest];
A[largest] = temp;
max_heapify(A, largest);
}
}
//建立最大堆
void build_max_heap(int *A)
{
int i;
//最后往前,不是叶子的结点开始遍历
for (i = heap_size / 2 - 1; i >= 0; i--)
{
max_heapify(A, i);
}
}
void heap_sort(int *A)
{
int temp;
int i;
build_max_heap(A);
for (i = heap_size - 1; i >= 0; i--)
{
temp = A[0];
A[0] = A[i];
A[i] = temp;
heap_size--;
max_heapify(A, 0);
}
}
//返回堆中最大最大值
int heap_maximum(int *A)
{
return A[0];
}
//移除堆中的最大值
int heap_extract_max(int *A)
{
int max;
if (heap_size < 1)
{
fprintf(stderr, "heap underflow");
}
max = A[0];
A[0] = A[heap_size - 1];
heap_size--;
max_heapify(A, 0);
return max;
}
//将堆中某一项的值增大到key,i的取值为0到heap_size-1
void heap_increase_key(int *A, unsigned int i, int key)
{
int temp;
if (key < A[i])
{
fprintf(stderr, "new key is smaller than current key");
}
A[i] = key;
while (i > 1 && A[parent(i)] < A[i])
{
temp = A[i];
A[i] = A[parent(i)];
A[parent(i)] = temp;
i = parent(i);
}
}
void max_heap_insert(int *A, int key)
{
heap_size++;
A[heap_size - 1] = INT_MIN;
heap_increase_key(A, heap_size - 1, key);
}
int main()
{
int array[] = {5, 10, 2, 3, 9, -1, 3};
unsigned int i;
heap_size = sizeof(array) / sizeof(int);
heap_sort(array);
for (i = 0; i < sizeof(array) / sizeof(int); i++)
{
printf("%d ", array[i]);
}
return 0;
}