堆排序算法的实现

代码如下：

#include <stdio.h>
#define DATA_ARRAY_SIZE 10
typedef int DataType;

void Swap(DataType *a, DataType *b)
{
    DataType temp = *a; 
    *a = *b;
    *b = temp;
    
    return;
}
void DisplayArray(DataType data[], const int size)
{
    for (int i = 0; i < size; i++) {
        printf("%d ", data[i]);
    }
    printf("\n");
    
    return;
}

void HeapSort(DataType src[], const int size);
void AdjustHeap(DataType src[], int i, const int size);
int main()

{
    DataType srcData1[DATA_ARRAY_SIZE] = {3,2,4,6,9,1,21,43,29,59};
    HeapSort(srcData1, DATA_ARRAY_SIZE);
    DisplayArray(srcData1, DATA_ARRAY_SIZE);
    return 0;
}

void HeapSort(DataType src[], const int size)
{
    //ajust the src from bottom no-leaf node until getting a heap
   for (int i = size / 2 - 1; i >= 0; i--) {
        AdjustHeap(src, i, size);
   }

    //swap current last node with first to ensure the last is the smallest
   for(int i = size -1; i > 0; i--) {
        Swap(&src[0], &src[i]);
        AdjustHeap(src, 0, i);
   }
   
    return;
}

void AdjustHeap(DataType src[], int i, const int size)
{
    DataType val = src[i];
    for (int k = 2 * i + 1; k < size; k = 2 * k + 1) {
        if (k + 1 < size && src[k] > src[k + 1]) {
            k++;
        }
        if (src[k] < val) {
            src[i] = src[k];
            i = k;
        } else {
            break;
        }
    }
    src[i] = val;
    
    return;
}