int max=0;

int left=Left(index);

int right=Right(index);

if((left<=heapSize)&&(a[left]>a[index]))max=left;

else

max=right;

if((right<=heapSize)&&(a[right]>a[max]))max=right;

if(max!=index){

swap(&a[index],&a[max]);

maxHeap(a,max);

}

int i;

heapSize=len;

for(i=(len>>1);i>=0;i--)maxHeap(a,i);

int i;

buildHeap(a,len-1);

for(i=len-1;i>=1;--i){

swap(&a[0],&a[i]);

--heapSize;

maxHeap(a, 0);

}

int a[]={45,68,20,39,88,97,46,59};

heapSort(a, 8);

for(int i=0;i<8;++i)cout<<a[i]<<" ";

cout<<endl;

return 0;