#include<iostream>
#include<algorithm>
#include<sstream>
#include<math.h>
#include<vector>
#include<queue>
#include<list>
#include<map>
#include<set>
#include<string>
#include<stdio.h>
#include<ctype.h>
#include<cstring>
#include<cstdlib>
#include<iomanip>
using namespace std;
int a[1005];
void quick_sort(int n,int e,int b)
{
if (e >= b) return;
int i = e;
int j = b;
a[0] = a[e];
while (i < j)
{
while (a[j] >= a[0]&&i<j)
{
j--;
}
if(i<j)a[i++] = a[j];
while (a[i] <= a[0] && i < j)
{
i++;
}
if(i<j)a[j--] = a[i];
}
a[i] = a[0];
for (int i = 1; i <= n; i++)
{
cout << a[i] << " ";
}
cout << "\n";
quick_sort(n, e, i-1);
quick_sort(n, i+1, b);
}
int main()
{
//freopen("in.txt", "r", stdin);
int n = 0;
cin >> n;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
quick_sort(n, 1, n);
}
c++快排
最新推荐文章于 2023-06-21 21:55:50 发布