//合并两个非递减循序表 typedef struct{ int data[maxsize]; int length; }sqlist; void exchange(sqlist *a,sqlsit *b,sqlist *c){ int i=0; int j=0; int j=0; while(i<a.length && j<b.length){ if(a[i]<b[j]) c.data[k++]=a.data[i++]; else(a[i]>b[j]) c.data[k++]=b.data[j++]; } while(i<a.length){ c.data[k++]=a.data[i++]; } while(j<b.length){ c.data[k++]=b.data[j++]; } c.length=k; }