#include <stdio.h>
void qsort(int a[], int low, int high); //low为数组a的最小下标,high为最大下标
int get_pos(int a[], int low, int high);
int main()
{
int i;
int a[40];
for (i=0; i<40; i++)
a[i] = i%10;
qsort(a, 0, 39);
for(i=0; i<40; i++)
printf("%d ", a[i]);
printf("\n");
return 0;
}
void qsort(int a[], int low, int high)
{
int pos;
if(low < high)
{
pos = get_pos(a, low, high);
qsort(a, low, pos-1);
qsort(a, pos+1, high);
}
}
int get_pos(int a[], int low, int high)
{
int val = a[low];
while (low < high)
{
while (low<high && a[high]>=val)
high--;
a[low] = a[high];
while (low<high && a[low]<=val)
low++;
a[high] = a[low];
}
a[low] = val;
return low;
}
void qsort(int a[], int low, int high); //low为数组a的最小下标,high为最大下标
int get_pos(int a[], int low, int high);
int main()
{
int i;
int a[40];
for (i=0; i<40; i++)
a[i] = i%10;
qsort(a, 0, 39);
for(i=0; i<40; i++)
printf("%d ", a[i]);
printf("\n");
return 0;
}
void qsort(int a[], int low, int high)
{
int pos;
if(low < high)
{
pos = get_pos(a, low, high);
qsort(a, low, pos-1);
qsort(a, pos+1, high);
}
}
int get_pos(int a[], int low, int high)
{
int val = a[low];
while (low < high)
{
while (low<high && a[high]>=val)
high--;
a[low] = a[high];
while (low<high && a[low]<=val)
low++;
a[high] = a[low];
}
a[low] = val;
return low;
}