堆相关操作

#include <iostream>
using namespace std;

void swap(int *a, int *b)
{
	int tmp = *a;
	*a = *b;
	*b = tmp;
}

/*
1.结点i的左右子节点下标分别为2i+1,2i+2
2.结点i的父结点下标为(i-1)/2
3.一颗完全二叉树的最后一个拥有子结点的结点下标为(n/2 - 1),n为结点数
*/

//下滤操作
void MinHeapFixDown(int *a, int i, int n)
{
	if (a == NULL || i < 0 || n < 0 || i >= n)
		return ;
	
	int tmp = a[i];
	int j = 2 * i + 1;    //左子结点
	while (j < n)
	{
		if (j + 1 < n && a[j + 1] < a[j])    //取左右子结点中小的那个
			j++;
		if (tmp <= a[j])    //父结点比子结点小
			break;
		
		a[i] = a[j];    //将子结点上滤，移到父结点位置
		i = j;            //将父结点移到子结点位置
		j = 2 * i + 1;    //取子结点的子结点
	}
	a[i] = tmp;
}

//上滤操作
void MinHeapFixUp(int *a, int i)
{
	if (a == NULL || i <= 0)
		return ;

	int tmp = a[i];
	int j = (i - 1) / 2;        //父结点
	while (j >= 0)
	{
		if (a[j] < tmp)
			break;
		a[i] = a[j];
		i = j;
		j = (i - 1) / 2;
	}
	a[i] = tmp;
}

//删除最小堆的堆顶元素
void DeleteMinHeap(int *a, int n)
{
	swap(&a[0], &a[n - 1]);        //将堆顶元素与最后一个元素互换
	MinHeapFixDown(a, 0, n - 1);   //将剩下n-1个元素恢复堆序性质
}

//插入元素到堆
void InsertMinHeap(int *a, int n, int v)
{
	a[n] = v;
	MinHeapFixUp(a, n);
}

//堆排序
void HeapSort(int *a, int n)    //用最小堆排序后是递减，用最大堆排序后是递增。
{
	if (a == NULL || n <= 0)
		return ;

	int i;
	for (i = n / 2 - 1; i >= 0; i--)        //堆化操作
		MinHeapFixDown(a, i, n);
	for (i = n - 1; i > 0; i--)
	{
		swap(&a[0], &a[i]);
		MinHeapFixDown(a, 0, i);
	}
}

int main()
{
	int a[10] = {3, 5, 1, 9, 0, 4, 7, 6, 8, 2};
	int b[20] = {3, 5, 1, 9, 0, 4, 7, 6, 8, 2};    //取20是为了有多余空间进行插入操作
	int i;
	for (i = 10/2 - 1 ; i >= 0; i--)        //堆化操作
		MinHeapFixDown(a, i, 10);
	for (i = 0; i < 10; i++)
		cout << a[i] << " ";
	cout << endl;

	HeapSort(b, 10);
	for (i = 0; i < 10; i++)
		cout << b[i] << " ";
	cout << endl;

	InsertMinHeap(b, 10, 22);
	for (i = 0; i < 11; i++)
		cout << b[i] << " ";
	cout << endl;

	return 0;
}

结果：