C语言快速排序

*/快速排序算法/*

int Partition(int D[], int l, int r)

{ D[0]=D[l];

while (l

D[l]=D[r];

while (l=D[l]) l++;

D[r]=D[l]; }

D[r]=D[0];

return r;

}

void Qsort(int D[], int l, int r)

{ int p;

if (l

Qsort(D, l, p-1);

Qsort(D, p+1, r); }

}

void QuickSort(int D[], int L)

{ Qsort(D, 1, L);

}

main()

{ int i;

int D[21]={0,12,5,36,13,22,19,2,7,33,52,23,42,25,31,12,20,8,16,27,2};

QuickSort(D,20);

printf("\n");

for(i=1; i<=20; i++) printf("%3d",D[i]);

}