排序类完整代码

前言

请配合此文查看数据结构复习
另外这是大二上写的，水平有限，若有不妥之处，请各位大佬不吝赐教指正。

完整代码

#include <iostream>
#include <random>
#include <queue>
#include <stack>
#include "myClock.h"
#include "MinHeap.h"

const int MatchMax = 99999;

using namespace std;


//锦标赛排序用到,不过暂时锦标赛排序代码没写成功
template<class T>
struct MatchNode {
    T data;
    int id;

    explicit MatchNode(T n = MatchMax, int id = -1) : data(n), id(id) {}
};

//桶排序要用到
template<class T>
struct NumNode {
    T data;
    NumNode *link;

    NumNode() : link(nullptr) { data = T(); }
};

//桶排序要用到
template<class T>
struct Bucket {
    NumNode<T> *adj;

    Bucket() : adj(nullptr) {}
};


template<class T>
class LinearSort {
public:
    LinearSort();

    LinearSort(T a[], int n);

    ~LinearSort();

    void changeArray(T a[], int n);

    void printArray();

    void BubbleSort();

    void BubbleSortBothWay();

    void InsertSort();

    void BinaryInsertSort();

    void QuickSort();

    void QuiSortNonRecursion();

    void ShellSort();//希尔排序

    void SelectSort();

//    void MatchSort(); 锦标赛排序

    void BucketSort(T minNum, T MaxNum);//桶排序

    void CountSort(T minNum, T MaxNum);//计数排序

    void HeapSort();//堆排序

    void MSDSort(int digits);//基数排序

    void MergeSort();//归并排序

    void MergeSort(int left, int right);

    void QuickSortByStackNonRecursion();

    void QuickSortByQueueNonRecursion();


private:
    T *array;
    int currentSize;

    int QuickPass(int low, int high);

    void swap(int i, int j);

    void QuickSort(int low, int high);

    void Merge(int l, int m, int r);
};

template<class T>
LinearSort<T>::LinearSort() {
    array = nullptr;
    currentSize = 0;
}


template<class T>
LinearSort<T>::LinearSort(T *a, int n) {
    array = new T[n + 1]; //浪费一个空间有用
    for (int i = 0; i < n; i++)
        array[i] = a[i];
    currentSize = n;
}

template<class T>
LinearSort<T>::~LinearSort() {
    delete array;
}


template<class T>
void LinearSort<T>::changeArray(T *a, int n) {
    if (array != nullptr)
        delete[] array;
    array = new T[n + 1];
    for (int i = 0; i < n; i++)
        array[i] = a[i];
    currentSize = n;
}

template<class T>
void LinearSort<T>::printArray() {
    for (int i = 0; i < currentSize; i++)
        cout << array[i] << " ";
    cout << endl;
}


//升序
template<class T>
void LinearSort<T>::BubbleSort() {
    if (!array)
        return;
    bool exchange;
    int i, j;
    int count = 0;//统计排序趟数
    for (i = 0; i < currentSize; i++) {
        exchange = false;
        for (j = 0; j < currentSize - 1; j++) {
            if (array[j] > array[j + 1]) {
                swap(j, j + 1);
                exchange = true;
            }
        }
        count++;
        if (!exchange)
            break;
    }
    cout << "经过 " << count << "次BubbleSort排序获得有序序列" << endl;
}

template<class T>
void LinearSort<T>::BubbleSortBothWay() {
    if (!array)
        return;
    bool exchange;
    int start[2] = {0, currentSize - 2};
    int end[2] = {currentSize - 1, -1};
    int move[2] = {1, -1};
    int count = 0; // 统计排序的趟数
    while (count < currentSize) {
        exchange = false;
        for (int i = start[count % 2]; i != end[count % 2]; i += move[count % 2]) {
            if (array[i] > array[i + 1]) {
                swap(i, i + 1);
                exchange = true;
            }
        }
        /*
         * cout << "count: " << count << "   ";
         * cout << "start: " << start[count % 2] << "  ";
         * cout << "end: " << end[count % 2] << endl;
         * cout << "array: ";
         * for (int i = 0; i < currentSize; i++)
         *      cout << array[i] << " ";
         *cout << endl << endl;
        */
        if (!exchange)
            break;
        count++;
    }
    cout << "经过 " << count << " 次双向BubbleSort排序获得有序序列" << endl;
}


template<class T>
void LinearSort<T>::InsertSort() {
    if (!array)
        return;
    int i, j;
    //多开了一个空间，放在了array[currentSize]
    for (int i = 1; i < currentSize; i++) {
        array[currentSize] = array[i];
        j = i - 1;
        while (array[currentSize] < array[j] && j >= 0) {
            //如果array[0]是多开的浪费空间的话可以把它考虑为哨兵,
            //这样就不用判断j >= 0
            array[j + 1] = array[j];
            j--;
        }
        array[j + 1] = array[currentSize];
    }
}

/*有哨兵的写法
 * template<class T>
 *void LinearSort222<T>::InsertSort() {
 * int i,j;
 * for(int i = 2; i < last; i++)
 * {
 *      data[0] = data[i];
 *      j = i - 1;
 *      while(data[0]<data[j])
 *          data[j + 1] = data[j--];
 *      data[j + 1] = 0
 * */


template<class T>
void LinearSort<T>::BinaryInsertSort() {
    if (!array)
        return;
    int mid;
    for (int i = 1; i < currentSize; i++) {
        int low = 0, high = i - 1;
        int temp = array[i];
        while (low <= high) {
            mid = (low + high) / 2;
            if (temp < array[mid])
                high = mid - 1;
            else
                low = mid + 1;
        }
        //由折半查找到的正确插入位置为high+1或者low
        for (int j = i - 1; j >= high + 1; j--)
            array[j + 1] = array[j];
        //在正确位置插入复制出来的待插入元素
        array[high + 1] = temp;
    }
}


template<class T>
void LinearSort<T>::QuickSort() {
    QuickSort(0, currentSize - 1);
}

template<class T>
int LinearSort<T>::QuickPass(int low, int high) {
    int down = low;
    int up = high;
    array[currentSize] = array[down];
    //此时array[down]空出来了
    while (down < up) {
        while (down < up && array[up] > array[currentSize])
            up--;       //从右边找到第一个比基准值array[down]小的就停下来
        if (down < up)
            array[down++] = array[up];
        //此时array[up]空出来了
        while (down < up && array[down] <= array[currentSize])
            down++;
        if (down < up)
            array[up--] = array[down];
        //此时array[down]空出来了
    }
    //此时down与up相遇了
    array[down] = array[currentSize];
    return down;//此时return的是一次操作基准值放的位置
}

template<class T>
void LinearSort<T>::QuickSort(int low, int high) {
    //这里判断只是为了排除没有数组的情况
    //实际上写快排算法不用的
    if (!array)
        return;
    if (low < high) {
        int mid = QuickPass(low, high);
        QuickSort(low, mid - 1);
        QuickSort(mid + 1, high);
    }
}


template<class T>
void LinearSort<T>::QuiSortNonRecursion() {
    //这里判断只是为了排除没有数组的情况
    //实际上写快排算法不用的
    if (!array)
        return;
    stack<int> st;
    int low = 0, high = currentSize - 1;
    if (low < high) {
        int mid = QuickPass(low, high);
        if (mid - 1 > low) {
            st.push(mid - 1);
            st.push(low);//逆序存放弹出来就会顺序啦
        }
        if (mid + 1 < high) {
            st.push(high);
            st.push(mid + 1);
        }

        while (!st.empty()) {
            // p < ... < q
            int p = st.top();
            st.pop();
            int q = st.top();
            st.pop();
            mid = QuickPass(p, q);
            if (mid - 1 > p) {
                st.push(mid - 1);
                st.push(p);
            }
            if (mid + 1 < high) {
                st.push(high);
                st.push(mid + 1);
            }
        }
    }
}

template<class T>
void LinearSort<T>::swap(int i, int j) {
    T temp = array[i];
    array[i] = array[j];
    array[j] = temp;
}


template<class T>
void LinearSort<T>::ShellSort() {
    int i, j, gap;
    gap = currentSize / 2;
    while (gap >= 1) {
        for (i = gap; i < currentSize; i++) {
            array[currentSize] = array[i]; //array[currentSize]为浪费的空间
            j = i - gap;
            while (array[currentSize] < array[j] && j >= 0) {
                array[j + gap] = array[j];
                j = j - gap;
            }
            array[j + gap] = array[currentSize];
        }
//        cout << "array: ";
//        printArray();
        gap = gap / 2;
    }
}


template<class T>
void LinearSort<T>::SelectSort() {
    int i, j, pos;
    for (i = 0; i < currentSize; i++) {
        pos = i;
        //前i个单元已经有序
        for (j = i + 1; j < currentSize; j++) {
            if (array[j] < array[pos])
                pos = j;
        }
        if (pos != j) {
            swap(i, pos);
        }
    }
}

//template<class T>
//void LinearSort<T>::MatchSort() {
//    int nodeNum = 1;
//    MatchNode *tree;
//    while(nodeNum < currentSize){
//        nodeNum *= 2;
//    }
//    tree = new MatchNode[nodeNum];
//    for(int i = 0, j = currentSize/2; i < currentSize; i++, j++){
//        tree[i].data = array[i];
//    }
//    for(int i = currentSize/2; i < currentSize; i = i + 2){
//        int j = i;
//        while(j > 0){
//            if(tree[j].data < tree[j + 1].data){
//                tree[(j - 1)/ 2].id = j;
//                tree[(j - 1)/ 2].data = tree[j].data;
//            }
//            else{
//                tree[(j - 1)/ 2].id = j + 1;
//                tree[(j - 1)/ 2].data = tree[j + 1].data;
//            }
//            j = (j - 1) / 2;
//        }
//    }
//    for(int i = 0; i < currentSize; i++)
//    {
//        array[i] = tree[0].data;
//        int j = (i % 2 == 0) ? i - 1 : i + 1;//右孩子编号为偶数
//        tree[(j - 1) / 2].data = tree[j].data;
//        tree[(j - 1) / 2].id = tree[j].id;
//        j = (j - 1) / 2;
//        while(j > 0){
//            int k = (j % 2 == 0) ? j - 1 : j + 1;
//            if(tree[j].data)
//        }
//    }
//}

//包括minNum,但不包括maxNum,范围够用时候范围给的越小越省空间
template<class T>
void LinearSort<T>::BucketSort(T minNum, T maxNum) {
    int bucketNum = maxNum - minNum;
    auto *bucket = new Bucket<T>[bucketNum];
    int i;
    NumNode<T> *p = nullptr, *q = nullptr;
    //浪费一个空间使算法统一
    for (i = 0; i < bucketNum; i++)
        bucket[i].adj = new NumNode<T>;

    int location = -1;
    for (i = 0; i < currentSize; i++) {
        location = array[i] - minNum;
        p = bucket[location].adj;
        q = new NumNode<T>;
        q->data = array[i];
        q->link = p->link;
        p->link = q;
    }

    int count = 0;
    for (i = 0; i < bucketNum; i++) {
        p = bucket[i].adj->link;
        while (p != nullptr) {
            cout << p->data << " ";
            array[count++] = p->data;
            p = p->link;
        }
        if (count == currentSize)
            break; //已经存完元素了
    }

    cout << endl;
}

//适合重复数据多并且不必保存其他信息的情况
//包括minNum,但不包括maxNum,范围够用时候范围给的越小越省空间
template<class T>
void LinearSort<T>::CountSort(T minNum, T MaxNum) {
    int bucketNum = MaxNum - minNum;
    T bucket[bucketNum];

    int i, count = 0;
    for (i = 0; i < bucketNum; i++)
        bucket[i] = 0;
    for (i = 0; i < currentSize; i++)
        bucket[array[i] - minNum]++;
    for (i = 0; i < bucketNum; i++) {
        while (bucket[i] > 0) {
            array[count] = i + minNum;
            cout << array[count] << " ";
            count++;
            bucket[i]--;
        }
        if (count == currentSize)
            break; //放完数了，收工
    }
    cout << endl;
}

template<class T>
void LinearSort<T>::HeapSort() {
    MinHeap<T> hp(array, currentSize);
    for (int i = 0; i < currentSize; i++) {
        hp.RemoveMin(array[i]);
    }
}

//digit为最高位，example：999 --> digit=3
template<class T>
void LinearSort<T>::MSDSort(int digits) {
    queue<T> bucket[10];
    //当然也可以合并到上面，不过这里为了直观
    //就单独拿出来了，取名为line
    queue<T> line;
    int weight, i;
    T bucketNum, data;

    for (i = 0; i < currentSize; i++) {
        line.push(array[i]);
    }

    for (int times = 1; times <= digits; times++) {
        //求比该位大一位数的权值
        weight = 1;
        for (i = 1; i < times; i++)
            weight = 10 * weight;

        while (!line.empty()) {
            data = line.front();
            line.pop();
            bucketNum = (data / weight) % 10;
            bucket[bucketNum].push(data);
        }
        cout << "第 " << times << "次: ";
        for (i = 0; i < 10; i++) {
            while (!bucket[i].empty()) {
                data = bucket[i].front();
                cout << data << " ";
                bucket[i].pop();
                line.push(data);
            }
        }
        cout << endl;
    }

    cout << "最终结果: " << endl;
    i = 0;
    while (!line.empty()) {
        data = line.front();
        line.pop();
        cout << data << " ";
        array[i++] = data;
    }
    cout << endl;
}

template<class T>
void LinearSort<T>::MergeSort() {
    MergeSort(0, currentSize - 1);
}

template<class T>
void LinearSort<T>::MergeSort(int left, int right) {
    if (left == right)
        return;
    int mid = (left + right) / 2;
    MergeSort(left, mid);
    MergeSort(mid + 1, right);
    Merge(left, mid, right);
}

template<class T>
void LinearSort<T>::Merge(int l, int m, int r) {
    int n = r - l + 1, i = 0;
    T *temp = new T[n];
    int left = l;
    int right = m + 1;
    while (left <= m && right <= r) {
        if (array[left] <= array[right])
            temp[i++] = array[left++];
        else
            temp[i++] = array[right++];
    }
    while (left <= m) {
        temp[i++] = array[left++];
    }
    while (right <= r) {
        temp[i++] = array[right++];
    }
    for (i = 0; i < n; i++)
        array[l + i] = temp[i];
    delete[] temp;
}

struct quNode {
    int low;
    int high;
};

template<class T>
void LinearSort<T>::QuickSortByQueueNonRecursion() {
    int mid; //mid为一趟快速排序后，基准记录所在位置指示器

    quNode xNode, yNode;
    queue<quNode> qu;

    xNode.low = 0;
    xNode.high = currentSize - 1;
    qu.push(xNode);

    while (!qu.empty()) {
        xNode = qu.front();
        qu.pop();
        mid = QuickPass(xNode.low, xNode.high);
        if (xNode.low < mid - 1) { //当左侧序列大于1则排序
            yNode.low = xNode.low;
            yNode.high = mid - 1;
            qu.push(yNode);
        }
        if (xNode.high > mid + 1) {//当右侧序列大于1则排序
            yNode.low = mid + 1;
            yNode.high = xNode.high;
            qu.push(yNode);
        }
    }
}

struct stNode {
    int low;
    int high;
};

template<class T>
void LinearSort<T>::QuickSortByStackNonRecursion() {
    int mid;

    stNode xNode, yNode;
    stack<stNode> st;

    xNode.low = 0;
    xNode.high = currentSize - 1;
    st.push(xNode);
    while(!st.empty()){
        xNode = st.top();
        st.pop();
        mid = QuickPass(xNode.low, xNode.high);
        if(xNode.low < mid - 1){ //当左侧序列大于1则排序
            yNode.low = xNode.low;
            yNode.high = mid - 1;
            st.push(yNode);
        }
        if(xNode.high > mid + 1){//当右侧序列大于1则排序
            yNode.low = mid + 1;
            yNode.high = xNode.high;
            st.push(yNode);
        }
    }
}


int main() {
//    int test1[10] = {9, 8, 3, 7, 1, 6, 0, 5, 2, 4};
    int test2[11] = {499, 158, 263, 348, 435, 575, 614, 758, 685, 10, 614};
//    int test4[11] = {9, 1, 2, 3, 4, 5, 6, 7, 8, 0, 5};
//    int test5[10] = {5, 3, 6, 7, 5, 3, 6, 8, 8, 3};
    int test3[15];
    srand(time(nullptr));
    for (int i = 0; i < 15; i++)
        test3[i] = (int) (rand() % 1000);


    LinearSort<int> linear1;
    linear1.changeArray(test3, 15);
//    linear1.MergeSort();
//    linear1.printArray();

    linear1.QuickSortByStackNonRecursion();
    linear1.printArray();


//    linear1.changeArray(test2, 11);
//    linear1.MSDSort(4);

//    linear1.changeArray(test5, 10);
//    linear1.CountSort(1, 12);
//    linear1.printArray();


//    linear1.changeArray(test4, 10);
//    linear1.BucketSort(0,10);
//    linear1.printArray();

//    linear1.changeArray(test1, 8);
//    linear1.BubbleSort();
//    linear1.printArray();

//    cout << endl << "插入排序" << endl;
//    linear1.changeArray(test1, 10);
//    linear1.InsertSort();
//    linear1.printArray();

//    cout << endl << "折半插入排序" << endl;
//    linear1.changeArray(test1, 10);
//    linear1.BinaryInsertSort();
//    linear1.printArray();

//    cout << endl << "快速排序" << endl;
//    linear1.changeArray(test1 ,10);
//    linear1.QuickSort();
//    linear1.printArray();

//    cout << endl << "希尔排序" << endl;
    linear1.changeArray(test1 ,10);
    linear1.ShellSort();
    linear1.printArray();

//    cout << endl << "选择排序" << endl;
//    linear1.changeArray(test1 ,10);
//    linear1.SelectSort();
//    linear1.printArray();


//    int temp[20000];
//    for(int i = 0; i < 20000; i++)
//        temp[i] = (int)(rand() % 100000);
//    myClock a;
    LinearSort<int> linear1(temp, 2000);
//    linear1.changeArray(temp, 20000);
//    a.start();
//    linear1.ShellSort();
//    a.end();
//
//    linear1.changeArray(temp, 20000);
//    a.start();
//    linear1.QuickSort();
//    a.end();
//    linear1.printArray();
//
//    linear1.changeArray(test3, 2000);
//    a.start();
//    linear1.BubbleSortBothWay();
//    a.end();
//    linear1.printArray();