数据结构之顺序表的基本操作

elemtype elem[maxsize];
int len;
}sqlist;
void great_list(sqlist *l,int n);//创表函数声明
int insert_sq(sqlist *l,int i,elemtype x);//插入函数声明
int delete_sq(sqlist *l,int i);//删除函数声明
int locate_sq(sqlist *l,elemtype x);//查找制定元素声明
void print_list(sqlist *l,int n);//输出函数声明
#include<stdio.h>
void main()
{int len,i,k,x;
sqlist s;
printf("\n----------Great_list-----------\n");
printf("please insert length ");
scanf("%d",&len);
great_list(&s,len);
print_list(&s,s.len);
printf("\n---------insert---------\n");
printf("please insert i,x");
scanf("%d,%d",&i,&x);
insert_sq(&s,i,x);
printf("\n------------print list----------------\n");
print_list(&s,s.len);
printf("\n---------delete---------\n");
printf("please delete i");
scanf("%d",&i);
delete_sq(&s,i);
printf("\n------------print list----------------\n");
print_list(&s,s.len);
printf("\n---------locat-------------\n");
printf("\n------------ locat number x-------------\n");
scanf("%d",&x);
k=locate_sq(&s,x);
printf("\n------------序号是-------------\n");
printf("%5d\n",k);

}
void great_list(sqlist *l,int n)
{
int k;
for (k=1;k<=n;k++)
scanf("%d",&l->elem[k]);
l->len=n;
}

void print_list(sqlist *l,int n)
{
int i;
for(i=1;i<=n;++i)
printf("%5d",l->elem[i]);
}

int locate_sq(sqlist *l,elemtype x)
{ int i;
for (i=1; i<=l->len; i++)
if (l->elem[i]==x)
return i;
return 0;
}

int insert_sq(sqlist *l,int i,elemtype x)

{
int j;
sqlist s;
if(i<1||i>l->len+1) return 0;
if(l->len==maxsize-1) return -1;
for(j=l->len;j>=i;--j)
l->elem[j+1]=l->elem[j];
l->elem[i]=x;
++l->len;
++s.len;
return 1;
}
int delete_sq(sqlist *l,int i)
{
int j;
sqlist s;
if(i<1||i>l->len) return 0;
if(l->len==0) return -1;
for(j=i;j<=l->len-1;j++)
l->elem[j]=l->elem[j+1];
--l->len;
--s.len;
return 1;
}