输入一个N , 然后是N个数
从小到大排序
#include<iostream>
using namespace std;
#include<ctime>
int arr[1000000];
template <typename T>
int partition(T arr[], int n, int m){
T v = arr[n];
int j = n;
for (int i = n + 1; i <= m; i++){
if (arr[i] < v){ swap(arr[i], arr[j + 1]); j++; }
}
swap(arr[n], arr[j]);
return j;
}
template <typename T>
void quicksort(T arr[], int l, int r){
if (l >= r) return;
int p;
p = partition(arr, l, r);
quicksort(arr, l, p);
quicksort(arr, p + 1, r);
}
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i++){
cin >> arr[i];
}
quicksort(arr, 0, n);
for (int i = 1; i < n + 1; i++)
{
cout << arr[i] << " ";
}
return 0;
}