算法与数据结构实验

.

{int i;

printf(\ for(i=0;i

printf(\} main() { int i,x; int n=10; sequenlist L; CreateList(&L,n); PrintList(&L,n); getchar(); } (2)

#include typedef int datatype; #define maxsize 1024 typedef struct {

.

.

datatype data[maxsize]; int last; }sequenlist;

int fun(sequenlist L,int x,int n) { }

void main() {

.

int i;

for(i=0;i

if(L.data[i]==x)

return i;

return -1;

sequenlist L; int i,n,y; int x;

printf(\请输入元素的个数：\scanf(\for(i=0;i

scanf(\

.

} (3)

}

printf(\请输入要查找的数据元素：\scanf(\y = fun(L,x,n); if (y==1)

printf(\所要查找的数据元素不存在\\n\

else

printf(\数据元素%d所在的位置为%d\\n\

#include #define maxsize 100 typedef struct {

int data[maxsize]; int last;

}sequenlist; main() {

.

int i,x,j;

sequenlist l={{1,2,4,5,6,7,8},6};

.

.

printf(\插入元素前的数据为:\for(i=0;i<=l.last;i++) printf(\

printf(\请输入要插入的元素:\ scanf(\ for(i=1;i<=l.last;i++)

if(l.data[i-1]>x) break;

if(i>l.last ) { } else { } l.last++;

printf(\插入元素后的数据为:\\n\ for(j=0;j<=l.last;j++) printf(\ printf(\

for(j=l.last;j>=i-1;j--) l.data[j+1]=l.data[j]; l.data[i-1]=x; l.data [l.last +1]=x;

.

return 0;

} (4)

#include #define maxsize 100 typedef struct {

int data[maxsize]; int last;

}sequenlist; main() {

.

int i,j,x=0,k=0;

sequenlist L={{1,3,5,7,2,4,6,8,2,9},9}; printf(\原数据为:\

for(i=0;i<=L.last;i++) printf(\ printf(\请输入要删除的数据:\ scanf(\ for(i=1;i<=L.last+1;i++)

if(L.data[i-1]==x)