堆排序

#include "iostream"
#include "vector"
#include "algorithm"
using namespace std;
void HeapAdjust(std::vector<int> &a,int i,int size){
	int left = 2*i + 1;
	int right = 2*i + 2;
	int max = i;
	if(i < size/2){
		if(left<size&&a[left]>a[max]) max = left;
		if(right<size&&a[right]>a[max]) max = right;
		if(max != i){
			swap(a[i],a[max]);
			HeapAdjust(a,max,size);
		}
		//cout<<i<<"\t";
	}
}
void BuildHeap(std::vector<int> &a){
	for (int i = a.size()/2 - 1; i >= 0; --i)
	{
		HeapAdjust(a,i,a.size());
	}
}
void HeapSort(std::vector<int> &a){
	BuildHeap(a);
	for (int i = a.size(); i > 0; --i)
	{
		swap(a[0],a[i-1]);
		HeapAdjust(a,0,i-1);
	}
}
int main(int argc, char const *argv[])
{
	std::vector<int> a(5);
	for (int i = 0; i < a.size(); ++i)
	{
		cin>>a[i];
	}
	HeapSort(a);
	for (int i = 0; i < a.size(); ++i)
	{
		cout<<a[i]<<"\t";
	}
	return 0;
}

下标从0开始，http://www.cnblogs.com/dolphin0520/archive/2011/10/06/2199741.html