顺序表的归并操作:
void merge(int* a, int m, int* b, int n, int* c) {
int i = 0, j = 0;
int k = 0;
while (i < m && j < n) {
if (a[i] < b[j])
c[k++] = a[i++];
else c[k++] = b[j++];
}
while (i < m) {
c[k++] = a[i++];
}
while (j < n) {
c[k++] = b[j++];
}
}
int main() {
seqlist a;
a.length = 5;
a.data[0] = 0;
a.data[1] = 2;
a.data[2] = 3;
a.data[3] = 5;
a.data[4] = 7;
seqlist b;
b.length = 3;
b.data[0] = 1;
b.data[1] = 4;
b.data[2] = 6;
seqlist t;
t.length = a.length + b.length;//记得赋值!&