堆排序，優先隊列實現

//堆排序
#include <iostream>
#include <vector>
using namespace std;

//vector<int> heap;
//父親節點
int parent(int i)
{
	if( i>=0) return (i+1)/2-1;
	else return 0;
}
//左孩子
int left(int i)
{
	if(i>=0) return (i+1)*2-1;
	else return 0;
}
//右孩子
int right(int i)
{
	if(i>=0) return (i+1)*2;
	else return 0;
}

 void maxHeapify(vector<int> & heap1,int i)
 {
	 int large=0;
	 bool flag =true;
	 int l=left(i),r=right(i);
	 int length=heap1.size();
	 if(!(i <0)&&i < length){
		 if(l < length)//有可能有left但沒right，此時只要成立一個條件就好，因爲不存在沒有left但有right！不考慮了
		 {
			 if (heap1[i] < heap1[l]) large =l;
			 else large = i;
			 if(r <length){
			 if(heap1[large] <heap1[r]) large =r;//左右根取其中最大
			 }
		 }else flag =false;
	 }
	 if(flag&&large !=i)//有一個孩子也能做下一步
	 {
		 int temp = heap1[large];
		 heap1[large] = heap1[i];
		 heap1[i] = temp;
		 maxHeapify(heap1,large);
	 }
 }
//建堆
 void buildMaxheap(vector<int> & heap1)
 {
	 int length =heap1.size();
	 for(int i=length/2-1;i >= 0;i--)
		 maxHeapify(heap1,i);
 }
 //堆排序
 vector<int> sortHeap(vector<int> heap1)
 {
	 vector<int> v;
	 int temp;
	 int length =heap1.size();
	 for(int i = length-1;i >= 0;i--)
	 {
		 v.push_back(heap1[0]);
		 temp =heap1[0];
		 heap1[0] = heap1[i];
		 heap1[i] = temp;
		 heap1.pop_back();
		 maxHeapify(heap1,0);
	 }
	 return v;
 }

 void increaseHeapKey(vector<int> &heap1,int i,int key)
 {//優先隊列堆某handler增加優先級 應用場景
	 int length =heap1.size();
	 i=i-1;
	 if(i<length&&i >= 0&&key > heap1[i])
	 {
		heap1[i] = key;
		while(i)
		{
			if(heap1[i] > heap1[parent(i)])
			{
				int temp = heap1[i];
				heap1[i] = heap1[parent(i)];
				heap1[parent(i)] = temp;
				i = parent(i);
			}else break;
		}
	 }
 }

 void insertHeap(vector<int> &heap1,int key)
 {//優先隊列加入某handler
	 int length =heap1.size();
	 heap1.push_back(key);//沒判斷capacity
	 int i =length-1;
	 while(i)
	 {
		 if(heap1[i] > heap1[parent(i)])
			{
				int temp = heap1[i];
				heap1[i] = heap1[parent(i)];
				heap1[parent(i)] = temp;
				i = parent(i);
			}else break;
	 }
 }

 void show(vector<int> & heap1)
 {
	 vector<int>::const_iterator pos;
	 for(pos =heap1.begin();pos !=heap1.end();++pos)
		 cout<<*pos<<" ";
	 cout<<endl;
 }

 void main()
 {
	 
	 int h[14]={0,1,3,4,5,7,8,9,10,12,13,16,17,27};
	 vector<int> heap(h,h+14);
	 cout<<"******************初始堆******************"<<endl;
	 show(heap);
	 buildMaxheap(heap);
	 cout<<"******************最大堆******************"<<endl;
	 show(heap);
	 cout<<"**************引用傳參堆排序**************"<<endl;
	 show(sortHeap(heap));
	 cout<<"****************最大堆不變****************"<<endl;
	 show(heap);
	 increaseHeapKey(heap,11,55);
	 cout<<"******優先隊列堆某handler增加優先級*******(此處增加11節點的爲55)"<<endl;
	 show(heap);
	 insertHeap(heap,106);
	 cout<<"**********優先隊列加入某handler***********（增加一個節點106）"<<endl;
	 show(heap);
	 int m;
	 cin>>m;
 }

小弟剛實現 忘指正