比较三种排序算法（冒泡、插入、归并）的时间复杂度

数据生成器：可用于生成三种类型（ 递增、递减、随机）不同量级（10^2 10^3等大小的）数据集

#include <iostream>
#include <fstream>
#include <random>
using namespace std;
enum DatasetType { INCREASING, DECREASING, RANDOM };
void generateDataset(long long N, long long s, long long t, DatasetType T, const string& filename) // 生成数据集函数
{
    ofstream outputFile(filename);
    if (!outputFile.is_open())
    {
        cerr << "Unable to open file: " << filename << endl;
        return;
    }
    random_device rd;
    mt19937 gen(rd());
    uniform_int_distribution<> dis(s, t);
    switch (T) {
        case INCREASING:
            for (long long i = s; i <= t; i+=(t-s)/N)
                outputFile << i << endl;
            break;
        case DECREASING:
            for (long long i = t; i >= s; i -= (t - s) / N)
                outputFile << i << endl;
            break;
        case RANDOM:
            for (long long i = 0; i < N; ++i)
                outputFile << dis(gen) << endl;
            break;
    }
    outputFile.close();
}
int main() {
    long long N = 100; // 数据集大小
    long long s = 1;   // 最小数值
    long long t = 10000000; // 最大数值
    DatasetType T = DECREASING; // 数据集类型
    string filename = "dataset102D.txt"; // 存储文件名
    generateDataset(N, s, t, T, filename);
    cout << "Dataset generated and stored in " << filename << endl;
    return 0;
}

三种排序的代码
1.冒泡排序
 

#include <iostream>
#include <fstream>
#include <vector>
#include <chrono> // 用于记录运行时间
using namespace std;

// 冒泡排序函数
void bubbleSort(vector<int>& arr) {
    int n = arr.size();
    for (int i = 0; i < n - 1; ++i) {
        for (int j = 0; j < n - i - 1; ++j) {
            if (arr[j] > arr[j + 1]) {
                swap(arr[j], arr[j + 1]);
            }
        }
    }
}

int main() {
    string filename = "dataset102I.txt"; // 数据文件名
    ifstream inputFile(filename);

    if (!inputFile.is_open()) {
        cerr << "Unable to open file: " << filename << endl;
        return 1;
    }

    vector<int> data;
    int value;
    while (inputFile >> value) {
        data.push_back(value);
    }

    inputFile.close();

    auto start = chrono::high_resolution_clock::now(); // 记录开始时间

    // 使用冒泡排序对数据进行排序
    bubbleSort(data);

    auto end = chrono::high_resolution_clock::now(); // 记录结束时间
    auto duration = chrono::duration_cast<chrono::milliseconds>(end - start); // 计算运行时间

    cout <<duration.count() << endl;
    return 0;
}

2.插入排序

#include <iostream>
#include <fstream>
#include <vector>
#include <chrono> // 用于记录运行时间
using namespace std;
void insertionSort(vector<int>& arr) // 插入排序函数
{
    int n = arr.size();
    for (int i = 1; i < n; ++i)
    {
        int key = arr[i];
        int j = i - 1;
        while (j >= 0 && arr[j] > key)
        {
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
}
int main() {
    string filename = "dataset106R.txt"; // 数据文件名
    ifstream inputFile(filename);
    if (!inputFile.is_open())
    {
        cerr << "Unable to open file: " << filename << endl;
        return 1;
    }
    vector<int> data;
    int value;
    while (inputFile >> value)
    {
        data.push_back(value);
    }
    inputFile.close();
    auto start = chrono::high_resolution_clock::now(); // 记录开始时间
    insertionSort(data);// 使用插入排序对数据进行排序
    auto end = chrono::high_resolution_clock::now(); // 记录结束时间
    auto duration = chrono::duration_cast<chrono::milliseconds>(end - start); // 计算运行时间
    cout << duration.count()<< endl;
    return 0;
}

3.归并排序
 

#include <iostream>
#include <fstream>
#include <vector>
#include <chrono> // 用于记录运行时间
using namespace std;
// Merge Sort 函数
void merge(vector<int>& arr, int l, int m, int r)
{
    int n1 = m - l + 1;
    int n2 = r - m;
    vector<int> L(n1), R(n2);
    for (int i = 0; i < n1; i++)
        L[i] = arr[l + i];
    for (int j = 0; j < n2; j++)
        R[j] = arr[m + 1 + j];
    int i = 0, j = 0, k = l;
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            arr[k] = L[i];
            i++;
        }
        else
        {
            arr[k] = R[j];
            j++;
        }
        k++;
    }
    while (i < n1)
    {
        arr[k] = L[i];
        i++;
        k++;
    }
    while (j < n2)
    {
        arr[k] = R[j];
        j++;
        k++;
    }
}
void mergeSort(vector<int>& arr, int l, int r)
{
    if (l >= r)
        return;
    int m = l + (r - l) / 2;
    mergeSort(arr, l, m);
    mergeSort(arr, m + 1, r);
    merge(arr, l, m, r);
}

int main() {
    string filename = "dataset106R.txt"; // 你的数据文件名
    ifstream inputFile(filename);
    if (!inputFile.is_open()) {
        cerr << "Unable to open file: " << filename << endl;
        return 1;
    }
    vector<int> data;
    int value;
    while (inputFile >> value) {
        data.push_back(value);
    }
    inputFile.close();
    auto start = chrono::high_resolution_clock::now(); // 记录开始时间
    // 使用 Merge Sort 对数据进行排序
    mergeSort(data, 0, data.size() - 1);
    auto end = chrono::high_resolution_clock::now(); // 记录结束时间
    auto duration = chrono::duration_cast<chrono::milliseconds>(end - start); // 计算运行时间
    cout <<duration.count() << endl;
    return 0;
}