#include<iostream>
#include"MinHeap.h"
using namespace std;
template<class T>
void HeapSort(T a[],int n){
T temp;
MinHeap<T> *m_heap = new MinHeap<T>(a,n);
for(int i = n-1; i >= 1; i--){//a[0]与a[i]交换,重新调整堆0--->i-1
temp = a[i];
a[i] = a[0];
a[0] = temp;
m_heap->FilterDown(0,i-1);
}
}
void main(){
int a[5] = {3,2,1,4,5};
HeapSort(a,5);
for(int i = 0; i < 5; i++)
cout<<a[i]<<" ";
cout<<endl;
}