快速排序
#include<iostream>
int a[101], n;
void quicksort(int left, int right)
{
int i, j, t, temp;
if (left > right)
return;
temp = a[left];
i = left;
j = right;
while (i != j)
{
while (a[j] >= temp && i < j)
--j;
while (a[i] <= temp && i < j)
++i;
if (i < j)
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
a[left] = a[i];
a[i] = temp;
quicksort(left, i - 1);
quicksort(i + 1, right);
}
int main()
{
int i, j, t;
std::cin >> n;
for (i = 1; i <= n; ++i)
std::cin >> a[i];
quicksort(1, n);
for (i = 1; i <= n; ++i)
std::cout << a[i] << " ";
return 0;
}