常见排序算法模板

快速排序

#include <bits/stdc++.h>

using namespace std;

void quick_sort(vector<int> &q, int l, int r)
{
    if (l >= r) return;

    int i = l - 1, j = r + 1, x = q[l + r >> 1];
    while (i < j)
    {
        do i ++ ; while (q[i] < x);
        do j -- ; while (q[j] > x);
        if (i < j) swap(q[i], q[j]);
    }
    quick_sort(q, l, j), quick_sort(q, j + 1, r);
}

int main()
{
    vector<int> q = {3,6,4,1,2,8,5};

    int l = 0,r = q.size() - 1;
    quick_sort(q,l,r);
    for(int i = 0;i <= r;++i){
        cout << q[i] << " ";
    }
    return 0;
}

冒泡排序

#include <bits/stdc++.h>

using namespace std;

void bubble_sort(vector<int> &arr, int len) {
    int i, j;
    for (i = 0; i < len - 1; i++)
        for (j = 0; j < len - 1 - i; j++)
            if (arr[j] > arr[j + 1]) {
                swap(arr[j],arr[j + 1]);
            }
}
int main() {
    vector<int> arr = { 22, 34, 3, 32, 82, 55, 89, 50, 37, 5, 64, 35, 9, 70 };
    int len = arr.size();
    bubble_sort(arr, len);
    int i;
    for (i = 0; i < len; i++)
       cout << arr[i] << " ";
    return 0;
}

选择排序

#include <bits/stdc++.h>

using namespace std;
void selection_sort(vector<int> &arr, int len)
{
    int i,j;

    for (i = 0 ; i < len - 1 ; i++)
    {
        int min = i;
        for (j = i + 1; j < len; j++)     //走訪未排序的元素
            if (arr[j] < arr[min])    //找到目前最小值
                min = j;    //紀錄最小值
           swap(arr[min], arr[i]);    //做交換
    }
}
int main()
{
    vector<int> arr = { 12, 34, 3, 32, 82, 55, 89, 50, 37, 5, 64, 35, 9, 70 };
    int len = arr.size();
    selection_sort(arr, len);
    int i;
    for (i = 0; i < len; i++)
       cout << arr[i] << " ";
    return 0;
}

归并排序

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 10;

int a[N], tmp[N];

void merge_sort(vector<int> &arr, int l, int r)
{
    if (l >= r) return;

    int mid = l + r >> 1;

    merge_sort(arr, l, mid), merge_sort(arr, mid + 1, r);

    int k = 0, i = l, j = mid + 1;
    while (i <= mid && j <= r)
        if (arr[i] <= arr[j]) tmp[k ++ ] = arr[i ++ ];
        else tmp[k ++ ] = arr[j ++ ];
    while (i <= mid) tmp[k ++ ] = arr[i ++ ];
    while (j <= r) tmp[k ++ ] = arr[j ++ ];

    for (i = l, j = 0; i <= r; i ++, j ++ ) arr[i] = tmp[j];
}

int main()
{
    vector<int> arr = { 13, 34, 3, 32, 82, 55, 89, 50, 37, 5, 64, 35, 9, 70 };
   int n = arr.size();

    merge_sort(arr, 0, n - 1);

    for (int i = 0; i < n; i ++ ) cout << arr[i] << " ";

    return 0;
}

插入排序

#include <bits/stdc++.h>

using namespace std;
void insertion_sort(vector<int> &arr, int len){
    int i,j,temp;
    for (i=1;i<len;i++){
            temp = arr[i];
            for (j=i;j>0 && arr[j-1]>temp;j--)
                    arr[j] = arr[j-1];
            arr[j] = temp;
    }
}
int main()
{
    vector<int> arr = { 13, 34, 3, 32, 82, 55, 89, 50, 37, 5, 64, 35, 9, 70 };
    int len = arr.size();
    insertion_sort(arr, len);
    int i;
    for (i = 0; i < len; i++)
       cout << arr[i] << " ";
    return 0;
}

希尔排序

#include <bits/stdc++.h>
using namespace std;

void shell_sort(vector<int> &arr, int len) {
    int gap, i, j;
    int temp;
    for (gap = len >> 1; gap > 0; gap = gap >> 1)
        for (i = gap; i < len; i++) {
            temp = arr[i];
            for (j = i - gap; j >= 0 && arr[j] > temp; j -= gap)
                arr[j + gap] = arr[j];
            arr[j + gap] = temp;
        }
}
int main()
{
    vector<int> arr = { 14, 34, 3, 32, 82, 55, 89, 50, 37, 5, 64, 35, 9, 70 };
    int len = arr.size();
    shell_sort(arr, len);
    int i;
    for (i = 0; i < len; i++)
       cout << arr[i] << " ";
    return 0;
}