归并排序(简单实现)

#include <iostream>
using namespace std;
int a[10] = {2, 3, 5, 8, 1, 3, 6, 7, 9, 10};
//合并a[first...mid-1]和a[mid...num-1],O(n)
void merge(int first, int mid, int num)
{
   if (mid == first || mid == num - 1)
   {
     return;
   }
   if (a[first] > a[mid])
   {
      int t = a[first];
      a[first] = a[mid];
      a[mid] = t;
      if (a[mid] > a[mid + 1])
        merge(mid, mid + 1, num - mid);
   }
   merge(first + 1, mid, num - 1);
}
//归并排序a[l，r-1] O(nlogn)，主定理

void merge_sort(int l, int r)
{
    if (l >= r - 1)
    {
      return;
    }
    int mid = (l + r) / 2;
    
    merge_sort(l, mid);
    merge_sort(mid, r);
    
    merge(l, mid, r - l);
}

int main()
{
     
   merge_sort(0, 10);
   for (int i = 0; i < 10; i++)
   {
     cout<<a[i]<<" ";
   }
   return 0;
}