Sort：Bubble&&Insert&&Shell&Merge

最新推荐文章于 2025-06-01 19:38:04 发布

原创最新推荐文章于 2025-06-01 19:38:04 发布 · 190 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Bubble #Insert #Shell #Merge

本文介绍了一种通用的排序类模板实现，其中包括插入排序、冒泡排序、希尔排序、归并排序等算法的具体实现过程，并通过一个示例展示了这些排序算法的应用。

一、结果显示

二、sort.h

#include<iostream>

using namespace std;

template<class T>
class sort
{
private:
    T a[10] = {'d','a','f','c','v','b','a','g','s','z'};
    int size = sizeof(a);
public:
    sort()
    {
        cout<<"size  = "<<size<<endl;
    }

    void Insert()
    {
        T b[10];
        int i,j;
        for(i =0; i < size; i++)
        {
            b[i] = a[i];
            char tmp = b[i];
            for(j = i; j > 0 && tmp < b[j-1] ; j--)
            {
                b[j] = b[j-1];
            }
            b[j] = tmp;
        }
        cout<<"Insert >>Sort : ";
        print(b);
    }

    void Bubble()
    {
        T b[10];
        for(int i = 0; i < size; i++)
            b[i] = a[i];
        for(int i = size; i > 0; i--)
        {
            for(int j = 1; j < i; j++)
            {
                if(b[j] < b[j-1])
                {
                    char tmp = b[j];
                    b[j] = b[j-1];
                    b[j-1] = tmp;
                }
            }
        }
        cout<<"Bubble >>Sort : ";
        print(b);
    }

    void Shell()
    {
        int j,k,gap;
        T b[10];
        for(int i = 0; i < size; i++)
            b[i] = a[i];
        for(gap = size/2 ; gap > 0 ; gap/=2)
        {
            for(k = gap; k < size ; k++)
            {
                T tmp = b[k];
                for(j = k ; j >= gap && tmp < b[j-gap]; j -= gap)
                {
                    b[j] = b[j-gap];
                }
                b[j] = tmp;
            }
        }
        cout<<"Shell  >>Sort : ";
        print(b);
    }

    void MergeSort()
    {
        T b[10];
        for(int i = 0; i < size; i++)
            b[i] = a[i];
        T tmp[size] = {0};
        MergeSort0( *b, *tmp, 0, size-1);
        cout<<"Merge  >>Sort : ";
        print(b);
    }
    void MergeSort0(T &a, T &tmp, int left, int right)
    {
        if(left < right)
        {
            int center = (left + right)/2;
            MergeSort0( a, tmp, left, center);
            MergeSort0( a, tmp, center + 1, right);
            Merge( &a, &tmp, left, center + 1, right);
        }
    }
    void Merge(T a[], T tmp[],int leftPos, int rightPos, int rightEnd)
    {
        int leftEnd = rightPos - 1;
        int tmpPos = leftPos;
        int ElementNum = rightEnd - leftPos + 1;
        while(leftPos <= leftEnd && rightPos <= rightEnd)
        {
            if(a[leftPos] < a[rightPos])
            {
                tmp[tmpPos++] = a[leftPos++];
            }
            else
            {
                tmp[tmpPos++] = a[rightPos++];
            }
        }
        while(leftPos <= leftEnd)
        {
            tmp[tmpPos++] = a[leftPos++];
        }
        while(rightPos <= rightEnd)
        {
            tmp[tmpPos++] = a[rightPos++];
        }

        for(int i = 0; i < size; i++,rightEnd--)
        {
            a[rightEnd] = tmp[rightEnd];
        }

    }

    void vprint()
    {
        cout<<"The source char array : ";
        print(a);
    }
    void print(char a[10])
    {
        for(int i = 0 ; i < size ; i++)
        {
            cout<<a[i]<<" ";
        }
        cout<<endl;
    }
};

三、main.cpp

#include "sort.h"

using namespace std;

int main()
{
    sort<char> T;
    T.vprint();
    T.Insert();
    T.Bubble();
    T.Shell();
    T.MergeSort();

    cout << "Hello world!" <<endl;
    return 0;
}