自带的inplace_merge的归并排序模版

//归并排序模板。记得和快排一块对着看。
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string.h>
#include<cstring>
#include<string>
#include<math.h>
#include<algorithm>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
const int maxn=1e5+5;
using namespace std;
int temp[maxn];
int num=0;///统计逆序对数的。
int number[30] = {23,3,26,24,5,1,12,21,29,15,17,10,7,22,6,20,19,11,2,4,9,25,13,27,14,18,28,8,16,30};
void mergesort(int left,int right)
{
    if(left>=right) return;
    int mid=(left+right)/2;
    mergesort(left,mid);
    mergesort(mid+1,right);
    inplace_merge(number+left, number+mid+1, number+right+1);
}
int main()
{
    mergesort(0,30-1);///初始化调用也要注意额。
    
    for(int i=0;i<30;i++){
        printf("%d ",number[i]);
    }
}