顺序表的应用集合的“并运算 void Union( seqlist &a, seqlist &B)i int n= Length(a); int m= Length(B) for (int i=0; i< m; i++) intx= GetData(B,i);在B中取一元素 intk=Find(A,x);M在A中查找它 f(k==-1) /若未找到插入它 iNsert(A, X,n ) n++;顺序表的应用:集合的“并”运算 void Union ( SeqList &A, SeqList &B ) { int n = Length ( A ); int m = Length ( B ); for ( int i = 0; i < m; i++ ) { int x = GetData ( B, i ); //在B中取一元素 int k = Find (A, x); //在A中查找它 if ( k == -1 ) //若未找到插入它 { Insert ( A, x, n ); n++; } } }