归并排序简单代码实现C++版-巧记法

最新推荐文章于 2024-04-16 09:19:28 发布

mazamu

最新推荐文章于 2024-04-16 09:19:28 发布

阅读量118

点赞数

分类专栏：数据结构与算法文章标签： c++ 数据结构算法

本文链接：https://blog.csdn.net/mazamu/article/details/119918321

版权

数据结构与算法专栏收录该内容

10 篇文章 0 订阅

订阅专栏

void merge(vector<int>&vt,int left,int mid,int right) {
    vector<int>tmp(right - left + 1);
    int i = left;
    int j = mid + 1;
    int k = 0;
    while(i <= mid && j <= right) {
        if(vt[i] <= vt[j]) {
            tmp[k++] = vt[i++];
        }else tmp[k++] = vt[j++];
    }
    while(i <= mid) tmp[k++] = vt[i++];
    while(j <= right) tmp[k++] = vt[j++];
    k = 0;
    while(left <= right) {
        vt[left++] = tmp[k++];
    }
}
void mergeSort(vector<int>&vt,int left,int right) {
    if(left < right) {
        int mid = (right - left) / 2 + left;
        mergeSort(vt,left,mid);
        mergeSort(vt,mid + 1,right);
        merge(vt,left,mid,right);
    }
}
int main(){
    vector<int>a = {3,1,5,7,2,4,9,6,10,8};
    jj01::mergeSort(a,0,a.size() - 1);
    for(auto it :a) cout<<it<<' ';
}