Sort 整理

 文章、图片参考：http://www.jianshu.com/p/1b4068ccd505?hmsr=toutiao.io&utm_medium=toutiao.io&utm_source=toutiao.io

这里用C++实现了部分排序，待更新。。。

 名词解释：

n: 数据规模
k:“桶”的个数
In-place: 占用常数内存，不占用额外内存
Out-place: 占用额外内存
稳定性：排序后2个相等键值的顺序和排序之前它们的顺序相同

 

冒泡排序动图演示：

 

选择排序动图演示：

 

插入排序动图演示：

归并排序动图演示：

快速排序动图演示：

堆排序动图演示：

计数排序动图演示：

LSD基数排序动图演示：

  1 #include <bits/stdc++.h>
using namespace std;
void InsertSort(int na[],int n)
{
    int tem,i,j;
    for(i=1; i<n; i++)
    {
        tem=na[i];
        j=i-1;
        while(j>=0&&tem<na[j])
        {
            na[j+1]=na[j];
            j--;
        }
        na[j+1]=tem;
    }
}
void ShellSort(int na[],int n)
{
    int i,j,d,tem;
    d=n/2;
    while(d>0)
    {
        for(i=d; i<n; i++)
        {
            j=i-d;
            while(j>=0&&na[j]>na[j+d])
            {
                tem=na[j];
                na[j]=na[j+d];
                na[j+d]=tem;
                j=j-d;
            }
        }
        d=d/2;
    }
}
void BubbleSort(int na[],int n)
{
    int i,j;
    for(i=0; i<n-1; i++)
        for(j=n-1; j>i; j--)
            if(na[j]<na[j-1])
            {
                na[j] ^= na[j-1];
                na[j-1] ^= na[j];
                na[j] ^= na[j-1];
            }
}
void QuickSort(int na[],int s,int t)
{
    int i=s,j=t,tem;
    if(s<t)
    {
        tem=na[s];
        while(i!=j)
        {
            while(j>i&&na[j]>tem)j--;
            na[i]=na[j];
            while(i<j&&na[i]<tem)i++;
            na[j]=na[i];
        }
        na[i]=tem;
        QuickSort(na,s,i-1);
        QuickSort(na,i+1,t);
    }
}
void SelectSOrt(int na[],int n)
{
    int i,j,k;
    for(i=0; i<n-1; i++)
    {
        k=i;
        for(j=i+1; j<n; j++)
            if(na[j]<na[k])
                k=j;
        if(k!=i)
        {
            na[i] ^= na[k];
            na[k] ^= na[i];
            na[i] ^= na[k];
        }
    }
}
void Heap_Sift(int na[],int low,int high)
{
    int i=low,j=2*i;
    int tem=na[i];
    while(j<=high)
    {
        if(j<high&&na[j]<na[j+1])j++;
        if(tem<na[j])
        {
            na[i]=na[j];
            i=j;
            j=2*i;
        }
        else break;
    }
    na[i]=tem;
}
void Heap_HeapSOrt(int na[],int n)
{
    int i,j;
    for(i=10; i>=1; i--)
        na[i]=na[i-1];
    for(i=n/2; i>=1; i--)
        Heap_Sift(na,i,n);
    for(i=n; i>=2; i--)
    {
        na[1] ^= na[i];
        na[i] ^= na[1];
        na[1] ^= na[i];
        Heap_Sift(na,1,i-1);
    }
}
void Merge_Merge(int na[],int low,int mid,int high)
{
    int *n1;
    int i=low,j=mid+1,k=0;
    n1=(int *)malloc((high-low+1)*sizeof(int));
    while(i<=mid&&j<=high)
        if(na[i]<=na[j])
            n1[k++]=na[i++];
        else
            n1[k++]=na[j++];
    while(i<=mid)
        n1[k++]=na[i++];
    while(j<=high)
        n1[k++]=na[j++];
    for(k=0,i=low; i<=high; k++,i++)
        na[i]=n1[k];
}
void Merge_MergePass(int na[],int length,int n)
{
    int i;
    for(i=0; i+2*length-1<n; i=i+2*length)
        Merge_Merge(na,i,i+length-1,i+2*length-1);
    if(i+length-1<n)
        Merge_Merge(na,i,i+length-1,n-1);
}
void Merge_MergeSort(int na[],int n)
{
    int length,k,i=1;
    for(length=1; length<n; length=2*length)
        Merge_MergePass(na,length,n);
}
void CountSort(int na[],int n)
{
    int nmax=0,i,j;
    for(i=0; i<n; i++)
        nmax=max(nmax,na[i]);
    int na1[nmax+1]= {0};
    for(i=0; i<n; i++)
        na1[na[i]]++;
    for(j=0,i=0; i<=nmax; i++)
        while(na1[i]--)
            na[j++]=i;
}
void Display(int na[],int n,string s)
{
    cout<<s<<": ";
    for(int i=0; i<n; i++)
        cout<<na[i]<<" ";
    cout<<endl;
}
void Display(int na[],int n)
{
    cout<<"HeapSort: ";
    for(int i=1; i<=n; i++)
        cout<<na[i]<<" ";
    cout<<endl;
}
#define n 10
int main()
{
    int na[n]= {9,8,7,-6,5,4,3,2,1,0};
    InsertSort(na,n);
    Display(na,n,"InsertSort");

    int na1[n]= {11,0,33,77,44,55,-3,88,22,99};
    ShellSort(na1,n);
    Display(na1,n,"ShellSort");

    int na2[n]= {17,11,12,13,14,15,-55,18,10,19};
    BubbleSort(na2,n);
    Display(na2,n,"BubbleSort");

    int na3[n]= {21,20,23,24,25,28,26,-7,22,29};
    QuickSort(na3,0,n-1);
    Display(na3,n,"QuickSort");

    int na4[n]= {31,32,38,30,33,34,-5,35,37,39};
    SelectSOrt(na4,n);
    Display(na4,n,"SelectSort");

    int na5[n]= {99,11,22,100,38,42,84,74,-24,60};
    Heap_HeapSOrt(na5,n);
    Display(na5,n);

    int na6[n]= {999,161,272,1800,398,-12,-12,744,531,620};
    Merge_MergeSort(na6,n);
    Display(na6,n,"MergeSort");

    int na7[n]= {999,161,272,1800,398,402,12,12,161,620};
    CountSort(na7,n);
    Display(na7,n,"CountSort(don't sort minus)");
    return 0;
}