下列是归并排序的部分代码，在所给空格行应填入

void MergeSort(int* arr,int left,int right,int* s){

if(right-left<=1){

return;

}

int mid=left+(right-left)/2;

MergeSort(arr,left,mid,s);

//( )

MergeData(arr,left,mid,right,s);

memcpy(arr+left,s+left,sizeof(arr[0])*(right-left));

}