voiddeleteEqual(PDSeqList psA,PDSeqList psB,PDSeqList psC){int j =0;int k =0;
bool flag = false;for(int i =0; i < psA->length;){
flag = false;for(; j < psB->length; j++){if(psB->elem[ j ]== psA->elem[ i ]){DeletePos(psA, i);
flag = true;break;}elseif(psB->elem[ j ]> psA->elem[ i ]){break;}}for(; k < psC->length; k++){if(psC->elem[ k ]== psA->elem[ i ]){DeletePos(psA, i);
flag = true;break;}elseif(psC->elem[ k ]> psA->elem[ i ]){break;}}if(!flag){
i++;}}}
设顺序表va中的数据元素递增有序。试写一算法,将x插入到顺序表的适当位置上,以保持该表的有序性。int orderInsert(PDSeqList Dseq, int key){ int i; for (i = 0; i < Dseq->length; i++) { if (Dseq->elem[i] > key) ...