数据结构之排序算法

快速排序算法：http://blog.csdn.net/liuchen1206/article/details/6954074

归并排序算法：http://blog.csdn.net/left_la/article/details/8656953

收集仅供参考

排序代码：

#include<iostream>
using namespace std;
void quickSort(int a[],int,int);
int main()
{
    int array[]={34,65,12,43,67,5,78,10,3,70},k;
    int len=sizeof(array)/sizeof(int);
    cout<<"The orginal arrayare:"<<endl;
    for(k=0;k<len;k++)
        cout<<array[k]<<",";
    cout<<endl;
    quickSort(array,0,len-1);
    cout<<"The sorted arrayare:"<<endl;
    for(k=0;k<len;k++)
        cout<<array[k]<<",";
    cout<<endl;
    system("pause");
    return 0;
}

void quickSort(int s[], int l, int r)
{
    if (l< r)
    {      
        int i = l, j = r, x = s[l];
        while (i < j)
        {
            while(i < j && s[j]>= x) // 从右向左找第一个小于x的数
                j--; 
            if(i < j)
                s[i++] = s[j];
            while(i < j && s[i]< x) // 从左向右找第一个大于等于x的数
                i++; 
            if(i < j)
                s[j--] = s[i];
        }
        s[i] = x;
        quickSort(s, l, i - 1); // 递归调用
        quickSort(s, i + 1, r);
    }
}

void Merge(int *a, int p, int q, int r)
{
    int n1 = q-p+1;
    int n2 = r-q;
    int *L = new int[n1+1];
    int *R = new int[n2+1];
    int i, j, k;
    
    for (i=0; i<n1; i++){
        L[i] = a[p+i];
    }
    for (j=0; j<n2; j++){
        R[j] = a[q+j+1];
    }
    L[n1] = 10000000;
    R[n2] = 10000000;

    for (i=0, j=0, k=p; k<=r; k++)
    {
        if (L[i]<=R[j])
        {
            a[k] = L[i];
            i++;
        }else{
            a[k] = R[j];
            j++;
        }
    }

    delete []L;
    delete []R;
}

void MergeSort1(int *a, int p, int r)
{
    if (p<r)
    {
        int q = (p+r)/2;
        MergeSort1(a, p, q);
        MergeSort1(a, q+1, r);
        Merge(a, p, q, r);
    }
}