归并排序代码

代码1-----将合并单独拆到一个函数merge

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

void merge(vector<int>&arr,int l,int mid,int r)
{
    vector<int>temp(r-l+1,0);
    int i=l,k=0,j=mid+1;
    while(i<=mid&&j<=r)
    {
        if(arr[i]<arr[j]) temp[k++]=arr[i++];
        else temp[k++]=arr[j++];
    }
    while(i<=mid) temp[k++]=arr[i++];
    while(j<=r) temp[k++] = arr[j++];
    for(i=l,k=0;i<=r;i++,k++)
    {
        arr[i]=temp[k];
    }
}

void merge_sort(vector<int>&arr,int l,int r)
{
    if(l<r)
    {
        int mid = (l+r)>>1;
        merge_sort(arr,l,mid);
        merge_sort(arr,mid+1,r);
        merge(arr,l,mid,r);
    }
}

int main()
{
    int n;
    cin>>n;
    vector<int>arr(n,0);
    for(int i = 0;i<n;i++)
    {
        cin>>arr[i];
    }
    merge_sort(arr,0,n-1);
    //打印输出
    for(int i = 0;i<n;i++)
    {
        cout<<arr[i]<<" ";
    }
    
    return 0;
}

代码2----分割和合并融入到一个函数中

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

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;
    vector<int>temp(r-l+1,0);
    while(i<=mid&&j<=r)
    {
        if(arr[i]<arr[j]) temp[k++]=arr[i++];
        else temp[k++]=arr[j++];
    }
    while(i<=mid) temp[k++]=arr[i++];
    while(j<=r) temp[k++] = arr[j++];
    for(i=l,k=0;i<=r;i++,k++)
    {
        arr[i]=temp[k];
    }
}

int main()
{
    int n;
    cin>>n;
    vector<int>arr(n,0);
    for(int i = 0;i<n;i++)
    {
        cin>>arr[i];
    }
    merge_sort(arr,0,n-1);
    //打印输出
    for(int i = 0;i<n;i++)
    {
        cout<<arr[i]<<" ";
    }
    
    return 0;
}