堆排序

#include <stdio.h>
#include <malloc.h>

#define LeftChild(i) (2*(i)+1)

typedef int ElementType;

void SwapTwoNum(ElementType *Num_1,ElementType *Num_2)
{
    int NumTemp = *Num_1;
    *Num_1 = *Num_2;
    *Num_2 = NumTemp;
}

void _PercDown(ElementType *Array,int CurrentPosition,int ArrayLen)
{
    int Child;
    ElementType TmpNum;
    
    for(TmpNum = Array[CurrentPosition];LeftChild(CurrentPosition) < ArrayLen;CurrentPosition = Child)
    {
        Child = LeftChild(CurrentPosition);
        if(Child != ArrayLen-1 && Array[Child+1] > Array[Child])
        {
            Child ++;
        }
        if(TmpNum < Array[Child])
        {
            Array[CurrentPosition] = Array[Child];
        }
        else
        {
             break;
        }
    }
    Array[CurrentPosition] = TmpNum;
}

void HeapSort(ElementType *Array,int ArrayLen)
{
    int i;
    //Build Heap
    for(i = ArrayLen/2;i >= 0;i --)
    {
        _PercDown(Array,i,ArrayLen);
    }
    
    //Delete max and put them to the Array end
    for(i = ArrayLen-1;i > 0;i --)
    {
        SwapTwoNum(&Array[0],&Array[i]);
        _PercDown(Array,0,i);
    }
}

int main()
{
    ElementType TestArray[10] = {718,224,3332,4443,55,31,66,79,90,7};
    HeapSort(TestArray,10);
    int i;
    for(i = 0;i < 10;i ++)
    {
        printf("%d ",TestArray[i]);
    }
    printf("
");
    return 0;
}