归并排序

 #include<iostream>

using namespace std;

int b[1000];

void merge(int *a,int l,int r)  //Shell排序

{

    if(l<r)

    {

        int m=(l+r)/2;

        merge(a,l,m);

        merge(a,m+1,r);

        //copy

        for(int i=l;i<=r;i++)

            b[i]=a[i];

        //merge

        int i,j,k;

        for(k=l,i=l,j=m+1;i<=m&&j<=r;)

            if(b[i]<b[j])

                a[k++]=b[i++];

        else

                a[k++]=b[j++];

        while(i<=m)

            a[k++]=b[i++];

    }

}

int main()

{

    int a[11]={1,92,30,0,4,25,6,7,8,9,10};

    merge(a,0,10);

    for(int i=0;i<11;i++)

        cout<<a[i]<<' ';

    cout<<endl;

    return 0;

}