堆排序(大顶堆)

#include<string>
#include <iostream>
#include<algorithm>
#include<vector>
using namespace std;

void adjust_heap(int a[],int root,int length){
	int left=2*root+1;
	int right=2*root+2;
	int max=root;
	if(left<length && a[left]>a[max]){
		max=left;
	}
	if(right<length && a[right]>a[max]){
		max=right;
	}
	if(max!=root){
		swap(a[max],a[root]);
		adjust_heap(a,max,length);
	}
}

void build_heap(int a[],int len){
	for(int i=len/2-1;i>=0;i--){
		adjust_heap(a,i,len);
	}
}

void heap_sort(int a[],int len){
	build_heap(a,len);
	for(int i=len-1;i>0;i--){
		swap(a[0],a[i]);
		adjust_heap(a,0,i);
	}
}

int main(){
	int a[] = {3, 2, 7, 4, 2, -999, -21, 99, 0, 9  };
	//int a[]={49,38,65,97,76,13,27,49,-999,-99};
	int n=sizeof(a)/sizeof(int);
	for(int i=0;i<n;i++){
		cout<<a[i]<<" ";
	}
	cout<<endl;
	heap_sort(a,n);
	for(int i=0;i<n;i++){
		cout<<a[i]<<" ";
	}
	return 0;
}