c++数据结构顺序表、单链表、查找的代码(2)

cout<<\ for(i=0;i SL_Listoperator+(SL_List&s1,SL_List&s2) {int k=0,i=0,j=0; SL_Lists; s.v=new T[s1.nn+s2.nn]; while((i

for(j=i;j

#include \ int main() {int k; double a[5]={1.5,5.5,2.5,4.5,3.5}; double b[7]={1.0,7.5,2.5,4.0,5.0,4.5,6.5}; SL_Lists1(20); SL_Lists2(30); for(k=0;k<5;k++) s1.insert_SL_List(a[k]); for(k=0;k<7;k++) s2.insert_SL_List(b[k]); cout<<\输出有序表对象s1:\ s1.prt_SL_List();

cout<<\输出有序表对象s2:\ s2.prt_SL_List(); SL_Lists3; s3=s1+s2;

cout<<\输出合并后的有序对象s3:\ s3.prt_SL_List();

s3.delete_SL_List(a[0]); s3.delete_SL_List(b[0]); s3.delete_SL_List(123.0); cout<<\输出删除后的有序表对象s3:\ s3.prt_SL_List(); return 0; }