第一个参数是数组首地址
第二个参数是数组元素个数
void HeapSort(int * const arr, const DWORD number)//堆排序
{
int tmp;
DWORD tmpIndex;
DWORD i=1;
DWORD num;
DWORD indexUp;
DWORD indexDown;
if (number < 2)
{
return;
}
indexUp = number-1;
if (0 != (indexUp%2))
{
tmpIndex = (indexUp - 1) / 2;
if (arr[indexUp] > arr[tmpIndex])
{
tmp = arr[indexUp];
arr[indexUp] = arr[tmpIndex];
arr[tmpIndex] = tmp;
}
indexUp--;
}
for (; indexUp>0; indexUp-=2)
{
tmpIndex = (indexUp / 2) - 1;
if (arr[indexUp-1] >= arr[indexUp])
{
if (arr[indexUp-1] > arr[tmpIndex])
{
tmp = arr[indexUp-1];
arr[indexUp-1] = arr[tmpIndex];
arr[tmpIndex] = tmp;
indexDown = indexUp-1;
}
else
{
continue;
}
}
else
{
if (arr[indexUp] > arr[tmpIndex])
{
tmp = arr[indexUp];
arr[indexUp] = arr[tmpIndex];
arr[tmpIndex] = tmp;
indexDown = indexUp;
}
else
{
continue;
}
}
while ((2*indexDown) < number)
{
tmpIndex = 2*indexDown +1;
if (arr[tmpIndex] >= arr[tmpIndex+1] || (tmpIndex+1 == number))
{
if (arr[tmpIndex] > arr[indexDown])
{
tmp = arr[indexDown];
arr[indexDown] = arr[tmpIndex];
arr[tmpIndex] = tmp;
indexDown = tmpIndex;
}
else
{
break;
}
}
else
{
if ((arr[tmpIndex+1] > arr[indexDown]) && (tmpIndex < number))
{
tmp = arr[indexDown];
arr[indexDown] = arr[tmpIndex+1];
arr[tmpIndex+1] = tmp;
indexDown = tmpIndex+1;
}
else
{
break;
}
}
}
}
tmp = arr[0];
arr[0] = arr[number-1];
arr[number-1] = tmp;

for (num=number-1; num>1; num--)
{
for (indexDown=0; (2*indexDown +1) < num; )
{
tmpIndex = 2*indexDown +1;
if (arr[tmpIndex] >= arr[tmpIndex+1])
{
if (arr[tmpIndex] > arr[indexDown])
{
tmp = arr[indexDown];
arr[indexDown] = arr[tmpIndex];
arr[tmpIndex] = tmp;
indexDown = tmpIndex;
}
else
{
break;
}
}
else
{
if ((arr[tmpIndex+1] > arr[indexDown]) && (tmpIndex+1 < num))
{
tmp = arr[indexDown];
arr[indexDown] = arr[tmpIndex+1];
arr[tmpIndex+1] = tmp;
indexDown = tmpIndex+1;
}