#include<stdio.h>
#define HAXSIZE 8
//实现归并,将数据放到lift中。
void nerging(int *left,int left_size,int *right,int right_size){
int i,j,k;
int temp[HAXSIZE];
i = j = k =0;
while(i < left_size && j <right_size){
if(left[i] < right[j]){
temp[k++] = left[i++]; //保存小的进数组
//printf("left = %d\n",*(left));
}else{
temp[k++] = right[j++];
//printf("right = %d\n",*(right));
}
}
while(i < left_size){ //将未保存的数保存进数组
temp[k++] = left[i++];
}
while(j < right_size){
temp[k++] = right[j++];
}
for(int n=0;n<(left_s