排序算法C++实现

(10条消息) 图解快速排序（C++实现）_Magnum的博客-CSDN博客_c++快速排序

#include <iostream>
#include <vector>
using namespace std;
//冒泡排序
void bubble_sort(vector<int> q) {
    int n = q.size();
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (q[j] > q[j + 1])
                swap(q[j], q[j + 1]);
        }
    }
}
//插入排序
void insert_sort(vector<int>& q) {
    int n = q.size();
    for (int i = 1; i < n; i++) {
        int j = i - 1;
        while (j >= 0 && q[j] > q[j + 1]) {
            swap(q[j], q[j + 1]);
            j--;
        }
    }
}
//选择排序
void select_sort(vector<int>& q) {
    int n = q.size();
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (q[i] > q[j])
                swap(q[i], q[j]);
        }
    }
}
//归并排序
void merge_sort(vector<int>& q, int l, int r) {
    if (l >= r) return;
    int m = r + l >> 1;
    merge_sort(q, l, m);
    merge_sort(q, m + 1, r);
    static vector<int> temp;
    temp.clear();
    for (int i = l, j = m + 1; i <= m || j <= r;) {
        if (i > m + 1)
            temp.push_back(q[j++]);
        else if (j > r)
            temp.push_back(q[i++]);
        else if (q[i] < q[j])
            temp.push_back(q[i++]);
        else
            temp.push_back(q[j++]);
    }
    for (int x : temp)
        q[l++] = x;
}
//快速排序
void quick_sort(vector<int> &q,int l,int r) {
    if (l >= r) return;
    int i = l, j = r + 1;
    int x = q[l];
    while (true) {
        while (q[++i] < x && i < r);
        while (q[--j] > x);
        if (i >= j) break;
        swap(q[i], q[j]);
    }
    q[l] = q[j];
    q[j] = x;
    quick_sort(q, l, j - 1);
    quick_sort(q, j + 1, r);
}
void print_q(vector<int> q) {
    for (int a : q)
        cout << a << " ";
    cout << endl;
}
int main() {
    vector<int> q = { 3,5,467,454,3,66,23,65,6 };
    //bubble_sort(q);//冒泡排序
    //insert_sort(q);//插入排序
    //select_sort(q);//选择排序
    //merge_sort(q, 0, q.size() - 1);//归并排序
    quick_sort(q, 0, q.size() - 1);//快速排序
    print_q(q);
    return 0;
}