几种排序算法温习

最新推荐文章于 2025-08-02 10:34:45 发布

11小鸟

最新推荐文章于 2025-08-02 10:34:45 发布

阅读量417

点赞数

CC 4.0 BY-SA版权

文章标签：算法 c

本文链接：https://blog.youkuaiyun.com/guchunhui2007/article/details/8016014

1、冒泡排序

void GloabPopoSort(int a[],int nCount)
{
    for (int i = 0;i<nCount;i++)
    {
        for (int j = i+1;j<nCount;j++)
        {
            if (a[i]>a[j])
            {
                a[i]^=a[j];
                a[j]^=a[i];
                a[i]^=a[j];
            }
        }
    }
}

改进后：

void Swap(int &a,int &b)
{
    int c = 0;
    c = a;
    a = b;
    b = c;
}

void PopoSort(int a[],int nCount)
{
    BOOL bRet = FALSE;
    do
    {
        bRet = FALSE;
        for (int i = 0;i<nCount-1;i++)
        {
            if(a[i]>a[i+1])
            {
                Swap(a[i],a[i+1]);
                bRet = TRUE;
            }
        }
        --nCount;
    }while(bRet);
}

2、选择排序

void GloabSeleSort(int a[],int nCount)
{
    for (int i = 0;i<nCount;i++)
    {
        int nMin = i;
        for (int j = i+1;j<nCount;j++)
        {
            if (a[nMin]<a[j])
            {
                nMin = j;
            }
        }
        a[i]^=a[nMin];
        a[nMin]^=a[i];
        a[i]^=a[nMin];
    }
}

改进后：

void Swap(int &a,int &b)
{
    int c = 0;
    c = a;
    a = b;
    b = c;
}

void SeleSort(int a[],int nCount)
{
    for (int i = 0;i<nCount-1;i++)
    {
        int nMin = i;
        for (int j = i+1;j<nCount;j++)
        {
            if (a[j]>a[nMin])
            {
                nMin = j;
            }
        }
        Swap(a[nMin],a[i]);
    }
}

3、插入排序

void InsrSort(int a[],int nCount)
{
    for (int i = 1;i<nCount;i++)
    {
        int Temp = a[i];
        int j = i;
        while (j>0 && Temp<a[j-1])
        {
            a[j] = a[j-1];
            j--;
        }    
        a[j] = Temp;
    }
}

4、快速排序

void FastSort(int a[],int nLow,int nHigh)
{
    int i,j,Key;
    if (nLow>nHigh)
    {
        return;
    }

    Key = a[nLow];
    i = nLow;
    j = nHigh;
    while (i != j)
    {
        while (i<j && a[j]>=Key) j--;
        a[i] = a[j];
        while (i<j && a[i]<=Key) i++;
        a[j] = a[i];
    }
    a[i] = Key;
    FastSort(a,nLow,i-1);
    FastSort(a,i+1,nHigh);
}