堆排序

#include

typedef struct

{

int r[11];

int length;

}SqList;

void swap (SqList * L, int i, int j)

{

int temp = L->r[i];

L->r[i] = L->r[j];

L->r[j] = temp;

}

void HeapAdjust (SqList *l, int s, int m)

{

int temp, j;

temp = l->r[s];

for (j = 2*s; j <= m; j*=2)

{

if (j < m && l->r[j] < l->r[j + 1])

j++;

if (temp >= l->r[j])

break;

l->r[s] = l->r[j]; //èç1û¸ù½úμãD¡óúὸö×ó½úμãÖD½Ï′óμÄ￡¬Ôò½»»»

s = j;

}

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 list;

int i;

list.length = 10;

for (i = 1; i < 11; i++)

{

scanf ("%d", &list.r[i]);

//getchar();

}

HeapSort (&list);

for (i = 1; i < 11; i++)

printf ("%d  ", list.r[i]);

return 0;

}

来自 “ ITPUB博客 ” ，链接：http://blog.itpub.net/25361369/viewspace-720405/，如需转载，请注明出处，否则将追究法律责任。

转载于:http://blog.itpub.net/25361369/viewspace-720405/