while (low<high&&fch(R[lowD low++ while(low<high&&! fch(R[high) high if (low<high) k=Rlow] Rlow]=R[high THigh]=k; low-low+1: high=n-1 while(low<high) while(low<high&&fnum(R[low) ow++ while(low<high&&l fnum(R[high) hi if (low<high) k=Rlow] Rlow]=R[high THigh]=k 5.线性表用顺序存储,设计一个算法,用尽可能少的辅助存储空间将顺序表中前n个元素和后n个元 素进行整体互换。即将线性表 (a,a2,…,an,b,b2,…,bn)改变为 (b,b2,….,bn,al,a2,….,am void process(seqlist *L, int m, int n) if(m<=n for(1=1;i<=m;i++) X=L->data[0I{ while (low<high&&fch(R[low])) low++; while (low<high&&!fch(R[high])) high--; if (low<high) { k=R[low]; R[low]=R[high]; R[high]=k; } } low=low+1;high=n-1; while (low<high) { while (low<high&&fnum(R[low])) low++; while (low<high&&!fnum(R[high])) high--; if (low<high) { k=R[low]; R[low]=R[high]; R[high]=k; } } } ⒌线性表用顺序存储，设计一个算法，用尽可能少的辅助存储空间将顺序表中前 m 个元素和后 n 个元 素进行整体互换。即将线性表 （a1, a2, … , am, b1, b2, … , bn） 改变为： （b1, b2, … , bn , a1, a2, … , am）。 void process(seqlist *L,int m,int n) { if (m<=n) for (i=1;i<=m;i++) { x=L->data[0];