手撕歸併排序

#include <cstdio>
#include <vector>
using namespace std;
void Merge(vector<int> &arr,int low,int mid,int high)
{
    int i=low;
    int j=mid+1;
    vector<int> temp;
    while(i<=mid&&j<=high)
    {
        if(arr[i]<arr[j])
        {
            temp.push_back(arr[i]);
            i++;
        }
        else
        {
            temp.push_back(arr[j]);
            j++;
        }
    }
    while(i<=mid)
    {
        temp.push_back(arr[i]);
        i++;
    }
    while(j<=high)
    {
        temp.push_back(arr[j]);
        j++;
    }
    for(i=low,j=0;i<=high;i++,j++)
    {
        arr[i]=temp[j];
    }
}
void mergeSort(vector<int> &arr,int low,int high)
{
    if(low>=high)
    {
        return;
    }
    int mid=(low+high)/2;
    mergeSort(arr,low,mid);
    mergeSort(arr,mid+1,high);
    Merge(arr,low,mid,high);
}
int main()
{
    vector<int> arr;
    int i;
    int temp;
    for(i=0;i<11;i++)
    {
        scanf("%d",&temp);
        arr.push_back(temp);
    }
    mergeSort(arr,0,10);
    for(i=0;i<11;i++)
    {
        if(i>0)
            printf(" ");
        printf("%d",arr[i]);
    }
    printf("\n");
    return 0;
}