快速排序

#include <stdio.h>
#include <stdlib.h>
void show(int *p, int length)
{
for (int i = 0; i < length; ++i)
{
printf("%4d", *(p + i));
}
}
quick_sort(int *p, int start, int end)
{
if (start<end)
{
int i = start;
for (int j = i + 1; j <= end; ++j)
{
if (p[j] < p[start])
{


int temp = p[i];
p[i] = p[j];
p[j] = temp;
}
}
int temp = p[i];
p[i] = p[start];
p[start] = temp;
quick_sort(p, start, i - 1);
quick_sort(p, i + 1, end);
}
}
void main()
{
int array[10] = { 1, 56, 12, 45, 67, 211, 985, 86, 123, 29 };
printf("排序前:");
show(array, 10);
printf("\n\n");
quick_sort(array, 0, 9);
printf("排序后:");
show(array, 10);
system("pause");
}