归并排序C++实现

归并排序C++实现

归并排序

基于分治法，利用归并操作，将两个有序序列合并成一个有序序列，将当前子序列分为两个子序列，递归地，使两个子序列有序，递归到只有一个元素的子序列，合并两个子序列，得到一个两个元素的有序子序列，再次合并得到一个含有四个元素的有序子序列，直到合并的序列为整个序列

合并操作

void merge(vector<int> & v, int start, int middle, int end) {
    vector<int> ans;
    ans.resize(end - start + 1);
    int i = start, j = middle + 1, k = 0;
    while (i <= middle && j <= end) {
        ans[k++] = v[i] > v[j] ? v[j++] : v[i++];
    }
    while (i <= middle) {
        ans[k++] = v[i++];
    }
    while (j <= end) {
        ans[k++] = v[j++];
    }
    for (int i = 0, j = start; j <= end ; i++, j++) {
        v[j] = ans[i];
    }
}

实现代码

/*
author : eclipse
email  : eclipsecs@qq.com
time   : Fri Jun 12 20:28:20 2020
*/
#include<bits/stdc++.h>
using namespace std;

void merge(vector<int> & v, int start, int middle, int end) {
    vector<int> ans;
    ans.resize(end - start + 1);
    int i = start, j = middle + 1, k = 0;
    while (i <= middle && j <= end) {
        ans[k++] = v[i] > v[j] ? v[j++] : v[i++];
    }
    while (i <= middle) {
        ans[k++] = v[i++];
    }
    while (j <= end) {
        ans[k++] = v[j++];
    }
    for (int i = 0, j = start; j <= end ; i++, j++) {
        v[j] = ans[i];
    }
}

void mergeSort(vector<int> &v, int start, int end) {
    if (start < end) {
        int middle = (start + end) / 2;
        mergeSort(v, start, middle);
        mergeSort(v, middle + 1, end);
        merge(v, start, middle, end);
    }
}

int main(int argc, char const *argv[]) {
    vector<int> v;
    int N = 10;
    for (int i = 0; i < N; i++) {
        int value = rand();
        v.push_back(value);
        printf("%d ", value);
    }
    printf("\n");
    mergeSort(v, 0, v.size() - 1);

    for (int i = 0; i < N; i++) {
        printf("%d ", v[i]);
    }
    return 0;
}

输出结果

41 18467 6334 26500 19169 15724 11478 29358 26962 24464
41 6334 11478 15724 18467 19169 24464 26500 26962 29358

最后

• 由于博主水平有限，不免有疏漏之处，欢迎读者随时批评指正，以免造成不必要的误解！