rt,代码:
#include<bits/stdc++.h>
using namespace std;
void Quick_Sort(int *arr, int begin, int end)
{
if(begin > end)
return;
int tmp = arr[begin];
int i = begin;
int j = end;
while(i < j)
{
while(arr[j] >= tmp && j > i)
j--;
while(arr[i] <= tmp && j > i)
i++;
if(j > i)swap(arr[i],arr[j]);
}
arr[begin] = arr[i];
arr[i] = tmp;
Quick_Sort(arr, begin, i-1);
Quick_Sort(arr, i+1, end);
}
int a[100010];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
int l=0,r=n-1;
Quick_Sort(a,l,r);
for(int i=0;i<n;i++)cout<<a[i]<<' ';
return 0;
}