shun xu biao.txt

顺序表的基本操作

1.	顺序表的建立，插入，删除的源程序：
#include "stdio.h"
#define maxsize 10
insert(char a[],char *p,int i,char e)
  { int j;
    if((i<0)||(i>*p+1))
      { printf("error");
      }
    if(*p>=maxsize-1)
      { printf("error");
      }
    for(j=*p+1;j>i;j--)                                                                
      a[j]=a[j-1];
    a[i]=e;
    (*p)++;
  }
delete(char a[],char *p,int i) 
  { int j;
    if((i<0)||(i>*p-1))
      { printf("error");
      }
    for(j=i;j<=*p;j++)
      a[j]=a[j+1];
    (*p)--;
  }
main()
  { int i=0;
    char *p,e,ch,a[maxsize];
    printf("input list is :");
    while((ch=getchar())!='\n')
      { a[i]=ch;
	i++;
      }
    *p=i-1;
    for(i=0;i<=*p;i++)
      printf("a[%d]=%c\n",i,a[i]);
    printf("input the position of date you want to insert:");  
    scanf("%d",&i);
    getchar();
    printf("insert data is ");
    e=getchar();
    getchar();
    insert(a,p,i-1,e);
    for(i=0;i<=*p;i++)
      printf("a[%d]=%c\n",i,a[i]);
    printf("input the position of date you want to delete:"); 
    scanf("%d",&i);
    delete(a,p,i-1);
    for(i=0;i<=*p;i++)
      printf("a[%d]=%c\n",i,a[i]);
    printf("\n");
  }