《C语言》数据机构实验报告.docVIP

数据结构实验报告 实验一：抽象数据类型的实现-以集合为例 问题：以集合为例设计一个抽象数据类型； 集合是对象的无序组合，我们可以把集合定义成一个新的数据类型; 为了简化可以把集合限制为有限整数元素的集合，有了这个限制，集合可以作为一个静态整数数组实现； 为了 操作方便，在处理对象中还包括集合的元素个数（即：集合基数）。 C语言程序代码： //------------------------------------------------------------- #include <iostream.h> #include<stdio.h> #define maxCard 16 #define maxLen 64 #define noErr 1 #define overflow 0 //------------------------------------------------------------- //定义结构体Set和Set_product struct Set{ int elems[maxCard]; int card; }; struct Set_product{ char elems[maxCard*maxCard][maxLen]; int card; }; //------------------------------------------------------------- // 函数声明 void EmptySet(Set *); int AddElem(Set *, int ); void Print(Set *); void RmvElem(Set *,int ); bool Member(Set *,int ); void Copy(Set * , Set * ); void Intersect(Set * , Set * , Set * ); int Union(Set * , Set * , Set * ); bool Equal(Set * , Set * ); bool Subset(Set * , Set * ); bool PSubset(Set * , Set * ); void Cartesian_product(Set * , Set * , Set_product *); void Print(Set_product *); //------------------------------------------------------------- // 主函数调用 int main() { Set s1,s2,s3; Set_product ss1; EmptySet(&s1); EmptySet(&s2); EmptySet(&s3); AddElem(&s1,10); AddElem(&s1,20); AddElem(&s1,30); AddElem(&s1,40); AddElem(&s2,30); AddElem(&s2,50); AddElem(&s2,10); AddElem(&s2,60); cout<<"s1 = "; Print(&s1); cout<<"s2 = "; Print(&s2); RmvElem(&s2,50); cout<<"s2 - {50} = "; Print(&s2); if (Member(&s1,20)) cout<<"20 is in s1" << endl; Intersect(&s1, &s2, &s3); cout<<"s1 intsec s2 = "; Print(&s3); Union(&s1, &s2, &s3); cout<<"s1 union s2 = "; Print(&s3); if (Subset(&s1,&s3)) cout<<"s1 is the subset of s3" << endl; if (PSubset(&s1,&s3)) cout<<"s1 is the pure subset of s3" << endl; if (!Equal(&s1,&s2)) cout<<"s1 /= s2 " << endl; else cout<<"s1 = s2 " << endl; Cartesian_product(&s1, &s2, &ss1); cout<<"s1 product s2 = "; Print(&ss1); getchar(); } //main //------------------------