已排序数组的合并

#include<iostream>
using namespace std;
void Array_Merge(int A1[], int n1, int A2[], int n2)
{
if (A1 == NULL || A2 == NULL || n1 <= 0 || n2 <= 0)
{
cout << "无效的参数 " << endl;
return;
}
int totalllength = n1 + n2 - 1;
int indexofA1 = 0;
int indexofA2 = 0;
int indexoftemp = 0;
int A1end = n1 - 1;
int A2end = n2 - 1;
int *Temp = (int *)malloc(sizeof(int)*(n1 + n2));
if (Temp == NULL)
{
cout << "内存不足" << endl;
return;
}
while (indexofA1 <= A1end&&indexofA2 <= A2end)
{
if (A1[indexofA1] <= A2[indexofA2])
{
Temp[indexoftemp++] = A1[indexofA1++];
}
else
{
Temp[indexoftemp++] = A2[indexofA2++];
}
}
while (indexofA1 <= A1end)
{
Temp[indexoftemp++] = A1[indexofA1++];
}
while (indexofA2 <= A2end)
{
Temp[indexoftemp++] = A2[indexofA2++];
}
for (int i = 0; i <= totalllength; i++)
{
A1[i] = Temp[i];
}
}
int main() 
{
int A1length, A2length;
int i;
cout << "输入数组A1,A2的数组长度：" << endl;
cin >> A1length >> A2length;
int *A1 = (int*)malloc(sizeof(int)*(A1length + A2length));
int *A2 = (int*)malloc(sizeof(int)*(A2length));
cout << "输入A1数组：" << endl;
for (int i = 0; i < A1length; i++)
{
cin >> A1[i];
}
cout << "输入A2数组：" << endl;
for (int i = 0; i < A2length; i++)
{
cin >> A2[i];
}
Array_Merge(A1, A1length, A2, A2length);
cout << endl << "合并数组，组成新的排序数组：" << endl;
for (int i = 0; i < A1length + A2length; i++)
{
cout << A1[i]<<" ";
}
cout << endl;
return 0;


}