较快的排序

希尔：

#include<iostream>
using namespace std;
const int maxn=500000;
int a[maxn];
void swap(int &a1 , int &a2){
     a1=a2^a1,a2=a1^a2,a1=a1^a2;
     }
int main(){
    int n;
    cin>>n;
    for (int i=1 ; i<=n; ++i) cin>>a[i];
    int d=n;
    while (d>1)
    {
          d=(d+1)/2;
          for (int i=d+1; i<=n; ++i)
              while (i>d&&a[i]<a[i-d])swap(a[i],a[i-d]),i-=d;
    }
    for (int i=1 ; i<=n; ++i) cout<<a[i]<<' ';
    cout<<endl;
}

快排：

#include<iostream>
using namespace std;
const int maxn=1000000;
int a[maxn];
void swap(int &a1,int &a2)
{
     a1=a1^a2,a2=a1^a2,a1=a1^a2;
}

void quick(int t,int h)
{
     int i=t,j=h,k,t1;
     k=a[(t+h)/2];
     while (i<=j)
     {
           while (a[i]<k) ++i;
           while (a[j]>k) --j;
           if (i<=j)
           {
                    if (i!=j)swap(a[i],a[j]);
                    ++i;--j;
           }
     }
     if (j>t)quick(t,j);
     if (h>i) quick(i,h);
}
int main(){
    int n;
    cin>>n;
    for (int i=1; i<=n;++i)cin>>a[i];
    quick(1,n);
    for (int i=1;i<=n;++i) cout<<a[i]<<' ';
    cout<<endl;
}