已知两个有序表A[0...n-1]和B[0...m-1]，试写一算法，将他们归并为一个有序表C[0...m+n-1]。 #define Maxsize (m + n) typedef int ElenType; typedef struct { ElenType data[Maxsize]; int length; } Sqlist; bool Merge(Sqlist A, Sqlist B, Sqlist &C) { if (A.length + B.length > C.Maxsize) return false; int i = 0, j = 0, k = 0; whil…