ACM 合并排序

#include "iostream"
#include "stdlib.h"
#include "search.h"
#include "algorithm"
using namespace std;


int a[1003];
int n;
void showArray(){
int i; for (i = 0; i < n - 1; ++i) {
cout << a[i];
if ((i + 1) % 10 == 0)
cout << endl;
else
cout << "  ";
}
cout << a[i] << endl;
}

void MergeCom(int *a, int p, int mid, int l)
{
int ni = mid - p + 1;
int nj = l - mid;
int *L = (int*)malloc(sizeof(int)*(mid - p + 1));
int *R = (int*)malloc(sizeof(int)*(l - mid));

for (int i = 0; i < ni; ++i)
L[i] = a[p + i];