void creatHeap(int A[],int n)
{
int left=(n-1)/2;
int right=n-1;
do
{
int i=left,j=2*i,x=A[i];
while(j<=right)
{
if(j<right)
if(A[j]<=A[j+1])
j++;
if (A[j]>x)
{
A[i]=A[j];
i=j;
j=2*i;
}
else
break;
}
A[i]=x;
left--;
}while(left>=0);
}
Sign up here with your email

ConversionConversion EmoticonEmoticon