堆排序

#include <stdio.h>

#define MAXSIZE    20

typedef struct
{
    int r[MAXSIZE];
    int length;
}SqList;

void swap (SqList *L, int i, int j)
{
    L->r[i] = L->r[i] + L->r[j];
    L->r[j] = L->r[i] - L->r[j];
    L->r[i] = L->r[i] - L->r[j];
}

void HeapAdjust (SqList *L, int s, int m)
{
    int temp, i;
    temp = L->r[s];
    for(i = 2*s; i <= m; i *= 2)
    {
        if(i < m && L->r[i] < L->r[i+1])
        {
            i++;
        }
        if(temp > L->r[i])
        {
            break;
        }
        L->r[s] = L->r[i];
        s = i;
    }
    L->r[s] = temp;
}

void HeapSort (SqList *L)
{
    int i;
    for(i = L->length/2; i > 0; i--)
    {
        HeapAdjust(L, i, L->length);
    }
    for(i = L->length; i > 1; i--)
    {
        swap(L, 1, i);
        HeapAdjust(L, 1, i-1);
    }
}

int main ()
{
    SqList L;
    int i;
    scanf("%d", &(L.length));
    for(i = 1; i <= L.length; i++)
    {
        scanf("%d", &(L.r[i]));
    }
    HeapSort(&L);
    for(i = 1; i <= L.length; i++)
    {
        printf("%d\n", L.r[i]);
    }
    return 0;
}