最大堆 堆排序

堆的各种操作，不算复杂，但要理解。

#include <iostream>
#include <stdlib.h>
using namespace std;
#define N 1000
#define PARENT(i) (i) >> 1
#define LEFT(i) (i) << 1
#define RIGHT(i) ((i) << 1) + 1 

class Heap
{
	public:
		int a[N + 1];
		int length;
		int heap_size;
		
		Heap()
		{
		}
		Heap(int size):length(size), heap_size(size)
		{
		}
		~Heap()
		{
		}
		
		//功能函数
		void AdjustMaxHeap(int i);
		void BuildMaxHeap();
		void HeapSort(int a[]);
		
		//优先队列函数
		void HeapIncreaseKey(int i, int key);
		void MaxHeapInsert(int key);
		int HeapMaximum();
		int HeapExtractMax();
		void HeapDelete(int i);
		
		//辅助函数
		void Print();
		void Print1(); 
};

void Heap::AdjustMaxHeap(int i)
{
	int l = LEFT(i);
	int r = RIGHT(i);
	
	int max;
	if(l < heap_size && a[l] > a[i])
	{
		max = l;
	}
	else
	{
		max = i;
	}
	if(r < heap_size && a[r] > a[max])
	{
		max = r;
	}
	
	if(max != i)
	{
		swap(a[i],a[max]);
		AdjustMaxHeap(max);
	}
}

void Heap::BuildMaxHeap()
{
	heap_size = length;
	for(int i = length / 2; i >= 0; i--)
	{
		AdjustMaxHeap(i);
	}
}

void Heap::HeapSort(int a[])
{
	BuildMaxHeap();
	
	for(int i = length - 1; i >= 1; i--)
	{
		swap(a[0], a[i]);
		heap_size--; 
		AdjustMaxHeap(0); //只有队顶的性质可能被破坏 
	}
}

void Heap::HeapIncreaseKey(int i, int key)
{
	if(key < a[i])
	{
		cout << "新增键值小于原键值 " << endl;
		exit(0); 
	}
	a[i] = key;
	while(a[i] > a[PARENT(i)] && i >= 0)
	{
		//a[i] = a[PARENT(i)];
		swap(a[i], a[PARENT(i)]);
		i = PARENT(i);
	}
	//a[i] = key;
}

void Heap::MaxHeapInsert(int key)
{
	if(heap_size == N)
	{
		cout << "堆已满" << endl; 
		exit(0);
	}
	heap_size++;
	length++;
	
	a[heap_size - 1] = -0x7fffffff;
	
	HeapIncreaseKey(heap_size - 1, key);
}

int Heap::HeapMaximum()
{
	return a[0];
}

int Heap::HeapExtractMax()
{
	if(heap_size < 0)
	{
		cout << "堆为空" << endl; 
		exit(0);
	}
	
	int max = a[0];	
	a[0] = a[heap_size - 1];
	heap_size--;
	length--;
	AdjustMaxHeap(0); 
	return max;
}

void Heap::HeapDelete(int i)
{
	HeapIncreaseKey(i, a[0]);
	HeapExtractMax();
}

void Heap::Print()
{
	for(int i = 0; i < heap_size; i++)
	{
		cout << a[i] << " ";
	} 
	cout << endl;
}

void Heap::Print1()
{
	for(int i = 0; i < length; i++)
	{
		cout << a[i] << " ";
	} 
	cout << endl;
}

int main()
{
	Heap t(8);
	t.a[0] = 3; t.a[1] = 6; t.a[2] = 10; t.a[3] = 20; t.a[4] = 14;
	t.a[5] = 23; t.a[6] = 17; t.a[7] = 22;
	
	cout << "数组初始化：" ;	
	t.Print();
	
	cout << "建立最大堆: " ;
	t.BuildMaxHeap();
	t.Print();
	
	cout << "删除最大堆的当前最大元素：";
	t.HeapExtractMax();
	t.Print();
	
	cout << "最大堆第5个数增加到15：";
	t.HeapIncreaseKey(5,15);
	t.Print();

	cout << "最大堆插入有一个元素56：";
	t.MaxHeapInsert(56);
	t.Print();

	cout << "最大堆排序: ";
	t.HeapSort(t.a);
	t.Print1();
		
	system("pause");
	return 0;
}