顺序表
typedef int ListItem;
typedef strcut alist *List;
typedef struct alist {
int n;
int maxsize;
ListItem *table;
}Alist;
查找元素x的位置
int findlocation (LIstItem x, List L){
int i;
for (i = 0; i<L->n; I++ ){
if (L->table [ i] ==x
){return ++i;}
}
return 0;
}
void insert (int k, ListItem x,List L){
for (int i = L->n-1; i>=k; i--){
L ->table [i+1]=L->table [i];
L->table [k]=x;
L->n++; }