heap sort

#include <stdio.h>
#include <stdlib.h>

void swap( int *temp1, int *temp2 ) //exchange two numbers
{
    int temp;
    temp = *temp1;
    *temp1 = *temp2;
    *temp2 = temp;
}

void MaxHeapify(int *arr, int i, int size)  //adjust the heap
{
    int lChild = 2*i+1, rChild = 2 * (i + 1);
    int largest;
	void swap( int *temp1, int *temp2 );
    if( lChild < size && arr[lChild] > arr[i])
	{
        largest = lChild;
	}
    else
	{
        largest = i;
	}
   if( rChild < size && arr[rChild] > arr[largest] )
   {
       largest = rChild;
   }
   if( i != largest)
   {
       swap(&arr[i], &arr[largest]);
       MaxHeapify( arr, largest, size);
   }
}

void BuildMaxHeap( int *arr, int size) //build the heap 
{
    int i;
	void MaxHeapify(int *arr, int i, int size);
    for( i = size / 2 - 1; i >= 0; i-- )
	{
        MaxHeapify(arr, i,size);
	}
}

void HeapSort( int *arr, int size ) //heap sort
{
    int i;
	void MaxHeapify(int *arr, int i, int size);
	void BuildMaxHeap( int *arr, int size);
    BuildMaxHeap( arr, size );
    for ( i = size-1; i >= 1; i--)
	{
        swap(&arr[0], &arr[i]);
        size--;
        MaxHeapify(arr, 0, size);
	}
}

int main(void)
{
    int a[]={0,16,20,3,11,17,8,0,23,45};
    int size = sizeof(a) / sizeof(a[0]), i;
	void HeapSort( int *arr, int size );
    HeapSort(a,size);
    for(i = 0;i < size;i++)
    printf("%d ",a[i]);
    printf("\n");  
    return 0;
}