#include<iostream>
using namespace std;
int n = 0;
int partition(int li[], int left, int right)
{
int tmp=0;
tmp = li[left];
while (left < right)
{
while (left < right && li[right] >= tmp)//从右边找比tmp小的数
right -= 1;//往左走一步
li[left] = li[right];//把右边的值写到左边空位上
while (left < right && li[left] <= tmp)
left += 1;
li[right] = li[left];//把左边的值写到右边空位上
}
li[left] = tmp;//把tmp归位
return left;
}
void quick_sort(int li[], int left, int right)
{
int mid=0;
if (left < right)//至少两个元素
{
mid = partition(li, left, right);
quick_sort(li, left, mid - 1);
quick_sort(li, mid + 1, right);
}
}
void print(int li[])
{
for (int i = 0; i < n; i++)
{
cout << li[i] << " ";
}
cout << endl;
}
int main()
{
cout << "输入元素个数:" << endl;
cin >> n;
int *li=new int[n];
cout << "输入要排序的数:" << endl;
for (int i = 0; i < n; i++)
{
scanf_s("%d", &li[i]);
}
quick_sort(li, 0, n-1);
print(li);
return 0;
}