上机实践1（Upper machine practice 1）.docVIP

上机实践1（Upper machine practice 1） Data structure practice on computer 1 Practical purpose On the basis of further understanding of the order, storage structure and basic operations of linear tables, we can flexibly apply and solve specific problems. Preliminary knowledge 1. sequential storage structure Typedef struct{ ElemType elem[MAXSIZE]; Int len; }SqList; 2. basic algorithm (1) building algorithm Void creat_list (SqList, *L, int, n) { Int k; Printf (\n, enter the element:); For (k=1; k=n; k++) scanf (L-elem[k]); L-len=n; } (2) insertion algorithm Int, Insert_Sq (SqList, *L, int, I, ElemType, x) { Insert a new element in the x*/ / I-1 between the linear table and the I element If (i1 iL-len+1 return 0 ||); / * I * / insertion position is not reasonable If (L-len==MAXSIZE-1) return -1; / * * / table is full For (j=L-len; j=i; --j) L-elem[j+1]=L-elem[j]; / * insert position and the element after the shift. L-elem[i]=x; / * * / insert x ++L-len; / * * / 1 meter long Return 1; } (3) deletion algorithm Int Delete_Sq (SqList, *L, int, I) { Remove the / * I elements in a linear form. If (i1 iL-len return 0 ||); / * delete unreasonable position i*/ If (L-len==0) return -1; / * * / table is empty For (j=i; j=L-len-1; j++) L-elem[j]=L-elem[j+1]; / * deleted elements beyond the left. --L-len; / * long table by 1*/ Return 1; } Application example -- merging linear tables 1 task description With two linear tables, La and Lb, the elements in the linear table Lb are required to be passed one by one to the end of the linear table La, and if the Lb has the same elements as the original La, the element is not incorporated into it. 2 task analysis (1) use linear table basic operations GetElem (Lb, I) to extract element x from Lb one by one; (2) use the basic operation Locate (La, x) to find whether there is the same element as X in the original La; (3) if lookup fails, use the basic operations Insert (La, I, x) to insert x into the end of the La. 3 algorithm description Void UnionLis