合并两升序数组称为一个升序数组算法

/*
*测试A，B两升序数列，合并为C的最优时间复杂度算法
*/
#include <iostream>
#include <stdlib.h>
using namespace std;

typedef int ElemType;

typedef struct NewArr{
ElemType *data;
int length;
}NewArr;

void print(NewArr arr)
{
cout<<"Arr:";
for(int i = 0; i < arr.length; i++)
{
cout<<arr.data[i]<<" ";
}
cout<<endl;
}

void merge_B(NewArr arrA, NewArr arrB, NewArr &arrC)
{
arrC.length = arrA.length + arrB.length;
arrC.data = new ElemType[arrC.length];
int i = 0,j = 0,k = 0;
while(i<arrA.length && j<arrB.length)
{
if(arrA.data[i] >arrB.data[j])
arrC.data[k++] = arrB.data[j++];
else
arrC.data[k++] = arrA.data[i++];
}

while(i<arrA.length) arrC.data[k++] = arrA.data[i++];
while(j<arrB.length) arrC.data[k++] = arrB.data[j++];
}

void Init(NewArr &arrA, NewArr &arrB)
{
int temp;
cout<<"请为Arr_a赋值：";
for(int i = 0; i < arrA.length; i++)
{
cin>>temp;
arrA.data[i] = temp;
}

cout<<"请为Arr_b赋值：";
for(int i = 0; i < arrB.length; i++)
{
cin>>temp;
arrB.data[i] = temp;
}
}

int main()
{
NewArr arr_a, arr_b, arr_c;
arr_a.length = 5;
arr_b.length = 5;
arr_a.data = new ElemType[arr_a.length];
arr_b.data = new ElemType[arr_b.length];
Init(arr_a,arr_b);
merge_B(arr_a,arr_b,arr_c);
print(arr_a);
print(arr_b);
print(arr_c);
return 0;
}