数据结构-电子商务2011级第一次上机指导

1、按照下列截图所示步骤建立程序的工程文件和程序文件1建立工程文件二、建立头文件三、建立C程序实现文件（函数文件）和主程序文件四、顺序表头文件示例头文件中的说明语句#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define TRUE 1#define FALSE 0#define List_Init_Size 100#define ListIncrement 10typedef char ElemType;typedef ElemType *Ep;typedef int Status;typedef stru

2、ct ElemType *elem;int Length;int ListSize; SqList;Status InitList_Sq( SqList &L);/* 初始化顺序表 */void ClearList(SqList &L);/* 清空顺序表 */ int ListLength(SqList L); /* 求顺序表长度 */Status ListEmpty(SqList L);/* 检查顺序表是否为空 */void Visit (ElemType &e); /* 访问函数-打印出数组中的数据元素值 */ Status ListTraverse(SqList L, void (*Vi

3、sit)(ElemType);/* 遍历顺序表 */ /* 从顺序表中查找元素 */Status GetElem(SqList L , int i, ElemType &e); /* 从顺序表中查找与给定元素值相同的元素在顺序表中的位置 */int LocateElem(SqList L, ElemType e);Status ListInsert(SqList &L,int i,ElemType e);/* 向顺序表中插入元素 */void printsq(SqList L);/* 打印顺序表*/void MenuSelect(SqList La);/*运行菜单*/五、实现文件中各种操作的实

4、现函数顺序表操作实现函数示例/*This program provide some functions for linear table. Header file writen user are sqlist.h */ #include #include #include #includesqlist.hStatus InitList_Sq( SqList &L) L.elem=(ElemType *)malloc(List_Init_Size*sizeof(ElemType); if(L.elem=NULL) return(OVERFLOW); L.Length=0; L.ListSize=

5、List_Init_Size; return OK;/*Insert the ith data into a linear table */Status ListInsert(SqList &L,int i,ElemType e) ElemType *p,*q; if (iL.Length+1) return ERROR; if(L.Length = L.ListSize) p=(ElemType*)realloc(L.elem,(L.ListSize+ListIncrement)*sizeof(ElemType); if (p=NULL) return(OVERFLOW); L.elem=p

6、;L.ListSize+=ListIncrement; q=L.elem+i-1; for(p=L.elem+L.Length-1;p=q;-p) *(p+1)=*p; *q=e; +L.Length; return OK;/*Output the linear table emements. */void printsq(SqList L) int i; printf(Size=%d Length=%d ,L.ListSize,L.Length); for (i=0;ie; ListInsert(La,i,e); break; case 2: printf(LA: );printsq(La);break; case 3: done=0;break; default: printf( ERRORn); printf(n); 六、主程序文件示例主程序文件程序实例#includestdio.h #includemalloc.h #includesqlist.hvoid main( ) SqList La; printf(init LA. ); InitList_Sq(La) ; printf(nnn