快速排序

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

}

int Partition (SqList *l, int low, int high)

{

int pivotkey;

pivotkey = l->r[low]; //óÃμúò»¸öÔaËØμ±ÖDÖá

while (low < high)

{

while (low < high && l->r[high] >= pivotkey)

high--;

swap (l, low, high);

while (low < high && l->r[low] <= pivotkey)

low++;

swap (l, low, high);

}

return low;

}

void QSort (SqList *l, int low, int high)

{

int pivot;

if (low < high)

{

pivot = Partition (l, low, high);

QSort(l, low, pivot - 1);

QSort(l, pivot + 1, high);

}

}

void QuickSort (SqList *l)

{

QSort(l, 1, l->length);

}

int main()

{

SqList list;

int i;

list.length = 10;

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

{

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

//getchar();

}

QuickSort(&list);

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

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

return 0;

}

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

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