c++的堆排序

#include <iostream>
using namespace std;
void swap(int * a,int *b);
void AdjustHeap(int data[],int start,int end)
{
int j=2*start+1;

//int temp=data[start];
while(j<end)
{
if(j==3) ;
if(data[j]<data[j+1]) j++;
if(data[start]>data[j])break;
swap(&data[j],&data[start]);
//i//f(start==1) cout<<j<<"dfd";
start=j;
j=2*start+1;
//if()


}
if(j==end) if(data[start]<data[end]) swap(&data[start],&data[end]);



}
void swap(int * a,int *b)
{
int temp =*a;
*a=*b;
*b=temp;
}
void HeapSort(int data[],int n)
{
int i =n/2;
for(i=(n-1)/2;i>=0;i--)
{
AdjustHeap(data,i,n-1);
int j=0;
cout<<i<<": ";
for(j=0;j<11;j++)
{
cout<<data[j]<<" ";
}
cout<<endl;
}
cout<<endl;


for(i=n-1;i>=1;i--)
{
swap(&data[0],&data[i]);

AdjustHeap(data,0,i-1);
int j=0;
cout<<i<<": ";
for(j=0;j<11;j++)
{
cout<<data[j]<<" ";
}
cout<<endl;
}


}
int main()
{
int data[] ={11,2,3,4,15,6,67,8,9,10,11};
HeapSort(data,11);
int i=0;
for(i=0;i<11;i++)
{
cout<<data[i]<<" ";
}
while(1);
return 0;
}