数据结构拾遗——排序(测试程序)

先总结一下各个排序算法的时间复杂度

排序方法	平均情况	最好情况	最坏情况	辅助空间	稳定性
冒泡	n^2	n	n^2	1	稳定
简单选择	n^2	n^2	n^2	1	稳定
直接插入	n^2	n	n^2	1	稳定
希尔	nlogn~n^2	n^1.3	n^2	1	不稳定
堆	nlogn	nlogn	nlogn	1	不稳定
归并	nlogn	nlogn	nlogn	n	稳定
快速	nlogn	nlogn	n^2	logn~n	不稳定

 

 

 

 

 

 

 

 

发现之前写的排序算法有几个都无法正常工作

写了个测试小程序

现在总算是都正确了

以后可能会测试一下时间

#include "BubbleSort.h"
#include "SelectSort.h"
#include "StraightInsertionSort.h"
#include "ShellSort.h"
#include "MergingSorth.h"
#include "HeapSort.h"
#include "QuickSort.h"
#include <random>
#include <iostream>
#include <time.h>
using namespace std;

void ShowVector(const vector<int> &v) {
    for (auto i:v)
    {
        cout << i << " ";
    }
    cout << endl;
}

void ShowSort(const vector<int> &v) {
    cout << "unordered:" << endl;
    cout << "    ";
    ShowVector(v);
    vector<int> 
        vBubble0 = v,
        vBubble1 = v,
        vBubble2 = v,
        vSelect = v,
        vStraightI = v,
        vShell = v,
        vHeap = v,
        vMerge = v,
        vQuick = v;
    BubbleSort0(vBubble0);
    cout << "BubbleSort0:" << endl;
    cout << "    ";
    ShowVector(vBubble0);

    BubbleSort1(vBubble1);
    cout << "BubbleSort1:" << endl;
    cout << "    ";
    ShowVector(vBubble1);

    BubbleSort2(vBubble2);
    cout << "BubbleSort2:" << endl;
    cout << "    ";
    ShowVector(vBubble2);

    SelectSort(vSelect);
    cout << "SelectSort:" << endl;
    cout << "    ";
    ShowVector(vSelect);

    StraightIS(vStraightI);
    cout << "StraightIS:" << endl;
    cout << "    ";
    ShowVector(vStraightI);

    ShellSort(vShell);
    cout << "ShellSort:" << endl;
    cout << "    ";
    ShowVector(vShell);

    HeapSort(vHeap);
    cout << "HeapSort:" << endl;
    cout << "    ";
    ShowVector(vHeap);

    MergingSort2(vMerge);
    cout << "MergingSort2:" << endl;
    cout << "    ";
    ShowVector(vMerge);

    QuickSort(vQuick);
    cout << "QuickSort:" << endl;
    cout << "    ";
    ShowVector(vQuick);

}

void SortCorrect() {
    uniform_int_distribution<int> rnd(-100, 1000);
    for (auto i = 0; i < 10; i++)
    {
        default_random_engine e((unsigned)time(NULL));
        vector<int> v;
        for (auto j = 0; j < 15; j++)
        {
            v.push_back(rnd(e));
        }
        ShowSort(v);
        system("pause");
    }
}

int main() {
    SortCorrect();
}