void Sort(int arr[],int left,int right);
int main(){
    int arr[N]={8,4,5,7,1,3,6,2};
    Sort(arr,0,N-1);
    printf("数组升序排列：");
    for (int i = 0; i < N; ++i) {
        printf("%d ",arr[i]);
    }
    printf("\n");
    return 0;
}
void Sort(int arr[],int left,int right){
    if(right==left){
        return;
    }
    int mid=(right+left)/2;
    Sort(arr,left,mid);
    Sort(arr,mid+1,right);

    int temp[N];
    int i=left;
    int j=mid+1;
    int k=left;
    while(i<=mid||j<=right){
        if(j>right||(i<=mid && arr[i]<arr[j])){
            temp[k]=arr[i];
            k=k+1;i=i+1;
        }else{
            temp[k]=arr[j];
            k=k+1;
            j=j+1;
        }
    }
    for (k = left; k <=right ; k++) {
        arr[k]=temp[k];
    }
}