acwing787归并排序，对数据结构书上讲的代码进行优化

题目链接

#include<iostream>
using namespace std;
//acwing 上的模板
const int N=100001;
//int n;
//int b[N];
void mergesort(int a[],int l,int r){
    //设置一个递归出口
    if(l>=r)return;
    //确定分界点
    int mid=l+r>>1;
    //递归处理（分治的细分）
    mergesort(a,l,mid);
    mergesort(a,mid+1,r);
    //合并子序列
  int i=l,k=0,j=mid+1,b[r-l+1];
  while(i<=mid&&j<=r){
      if(a[i]<=a[j])
      b[k++]=a[i++];
      else b[k++]=a[j++];
      
  }      
    while(i<=mid)b[k++]=a[i++];
    while(j<=r)b[k++]=a[j++];
    //将每次递归排的有序部分放入原数组
    for(i=l,j=0;i<=r;i++,j++)//自己特别爱给i++丢掉
    a[i]=b[j];
    
}


int main(){
   int n;
   cin>>n;
   int a[n];
   for(int i=0;i<n;i++){
       cin>>a[i];
   }
   mergesort(a,0,n-1);
 for(int i=0;i<n;i++){
      cout<<a[i]<<" ";
   }
   
    
}

之前数据结构书上的算法

#include <bits/stdc++.h>
using namespace std;
void fun(int A[], int low, int mid, int high)
{
  int *B = new int[high - low + 1];
  int i = low, j = mid + 1;
  for (int k = low; k <= high; ++k)
    B[k] = A[k];
  int k = i;
  for (; i <= mid && j <= high; ++k)
  {
    if (B[i] <= B[j])
      A[k] = B[i++];
    else
      A[k] = B[j++];
  }
  while (j <= high)
    A[k++] = B[j++];
  while (i <= mid)
    A[k++] = B[i++];
}
void MergeSort(int A[], int low, int high)
{
  if (low < high)
  {
    int mid = (low + high) / 2;
    MergeSort(A, low, mid);
    MergeSort(A, mid + 1, high);
    fun(A, low, mid, high);
  }
}