c++几种排序算法代码

#include <iostream>
#include <vector>
using namespace std;

//交换int
void swap(int& a, int& b){
    int temp = a;
    a = b;
    b = temp;    
}

//冒泡
void BulletSort(vector<int>& nums){
    int n = nums.size();
    for (int i = 0; i < nums.size()-1; i++){
        for (int j = 0; j < nums.size() - i -1; j++){
            if (nums[j] > nums[j+1]){
                swap(nums[j], nums[j+1]);
            }
        }
    }
}

//快排
void fastSort(vector<int>&num, int first, int last){
    if (first < last){
        int i = first;
        int j = last;
        int seed = num[i];
        while (i<j){
            while (i < j && num[j] >= seed){
                j--;
            }
            if (i < j){
                num[i++] = num[j];
            }
            while (i <j && num[i] <= seed){
                i++;
            }
            if (i < j){
                num[j--] = num[i];
            }
        }
        num[i] = seed;
        fastSort(num, first, i - 1);
        fastSort(num, i + 1, last);
    }

}


//插入
void InsertSort(vector<int>& nums){
    int n = nums.size();
    for (int i = 0; i < n; i++){
        for (int j = i; j > 0; j--){
            if (nums[j] < nums[j - 1]){
                swap(nums[j], nums[j - 1]);
            }
        }
    }
}

//归并数组
void mergeArray(vector<int>&nums, int first, int mid, int last, vector<int>temp){
    int i = first;
    int j = mid + 1;
    int m = mid;
    int n = last;
    int k = 0;
    while (i <= m&& j<=n){
        if (nums[i] < nums[j]){
            temp[k++] = nums[i++];
        }
        else{
            temp[k++] = nums[j++];
        }
    }
    while (i<=m){
        temp[k++] = nums[i++];
    }
    while (j <= n){
        temp[k++] = nums[j++];
    }
    for (int i = 0; i < k; i++)
    {
        nums[first+i] = temp[i];
    }
}

//归并
void mergeSort(vector<int>& nums, int first, int last, vector<int>temp){
    if (first<last){
        int mid = (first + last) / 2;
        mergeSort(nums, first, mid, temp);
        mergeSort(nums, mid + 1, last, temp);
        mergeArray(nums,first,mid,last,temp);

    }
}

int main()
{
    vector<int>test;
    vector<int>temp(4, 0);
    test.push_back(2);
    test.push_back(4);
    test.push_back(1);
    test.push_back(3);
    //BulletSort(test);
    //fastSort(test, 0, 3);
    //InsertSort(test);
    //mergeSort(test, 0,3,temp);
    return 0;

}

　　几种算法的比较如下图所示