堆排序构建大根堆 java

private static int[] test(int[] a)
{
int total = a.length;
for(int i = 2; i >= 0; i--)
{
int k = (int) Math.pow(2, i + 1) -1;
int count = (int) Math.pow(2, i) - 1;
for(int num = 0, j = k - 1 - count; num <= count; j++)
{
int left = j * 2 + 1;
int right = j * 2 + 2;
int max = 0;
if(left >= total)
{
left = -1;
break;
}
if(right >= total)
{
right = - 1;
}
if(left != -1)
{
max = a[left];
if(right < total && max < a[right])
{
max = a[right];
if(max > a[j])
{
max = a[right];
a[right] = a[j];
a[j] = max;
}
}
if(right < total && max > a[right])
{
if(max > a[j])
{
max = a[left];
a[left] = a[j];
a[j] = max;
}
}
if(right == -1)
{
if(a[j] < max)
{
max = a[left];
a[left] = a[j];
a[j] = max;
}
}
}
}
}

return a;
}