//静态顺序表
#define OK 1
#define ERROR 0
#define M 5
#include <stdio.h>
typedef struct
{
int elem[M];
int length;}sqlist;
int initlist_sq(sqlist *L)
{
L->length=0;
return OK;
}
int listinsert(sqlist *L,int i,int e)
{
int *q,*p;
if(i<1||i>L->length+1) return ERROR;
if(L->length>=M) return ERROR;
q=&L->elem[i-1];
for (p=&L->elem[L->length-1];p>=q;--p) *(p+1)=*p; *q=e; ++L->length;
return OK;
}
void output(sqlist *L)
{
int i;
for (i=0;i<L->length;i++) printf("%5d",L->elem[i]); printf("/n");
}
int listdelete(sqlist *L,int i,int *e)
{
int *q,*p;
if(i<1||i>L->length) return ERROR;
p=&L->elem[i-1];
*e=*p;
q=&L->elem[L->length-1];
for(++p;p<=q;++p) *(p-1)=*p;
--L->length;
return OK;
}
int Get(sqlist *L,int i,int *e)
{
int *p;
if((i<1)||(i>L->length))return ERROR;
p=&(L->elem[i-1]);
*e=*p;
return OK;
}
int LocateElem_Sq(sqlist *L,int e)
{ int i;
int *p;
i=1;
for(p=&L->elem[0];i<=L->length && *p!=e;p++) ++i;
if(i<=L->length)return i;
else return 0;
}
main()
{ sqlist sb; int i,x,y,d=1,c;
while(d)
{ printf("/ninput mode/n");
printf("1:creat 2:insert 3:output 4:delete 5:get 6:Locate 7:exit/n");
scanf("%d",&c);
switch(c)
{ case 1:y=initlist_sq(&sb);
if (y)printf("that's OK!/n"); else printf("sorry!/n"); break;
case 2:printf("enter insert i,x:"); scanf("%d%d",&i,&x);
y=listinsert(&sb,i,x);
if (y)printf("the data %d inserted./n",x); else printf("sorry!/n"); break;
case 3: output(&sb); break;
case 4:printf("enter delete num:"); scanf("%d",&i);
y=listdelete(&sb,i,&x);
if (y)printf("the data %d deleted./n",x); else printf("the data not found./n");
break;
case 5:printf("/ninput the num:"); scanf("%d",&i);
y=Get(&sb,i,&x);
if (y) printf("/nthe num %d data is %d./n",i,x); else printf("/nthe data not found./n");
break;
case 6:printf("enter LocatedData x:"); scanf("%d",&x);
i=LocateElem_Sq(&sb,x);
if (i!=0) printf("/nthe data %d is num .%d./n",x,i); else printf("/nthe data not found./n");
break;
case 7:d=0; break;
}
}
}