线性表的顺序存储结构 （一）

附加：
      text.rar  
代码：

#include <stdio.h>
#include <malloc.h>
#define Maxsize 50

typedef elem_type;
typedef struct
{
    elem_type data[Maxsize];
    int length;
}SQLIST;

void init_list(SQLIST *sqlist) //初始化 length长度
{
    sqlist->length=0;
}

int get_length(SQLIST *sqlist) // 返回顺序表的 域值
{
    return sqlist->length;
}

int get_elem(SQLIST *sqlist,int i,elem_type *elem)  //求线性表中第i个元素
{
    if(i<1||i>sqlist->length)  //无效
        return 0;
    else
    {
        *elem=sqlist->data[i-1];
        return 1;
    }
}

int locate(SQLIST *sqlist,elem_type x) //在顺序表中查找第一个值为x的元素，
{                                     //返回其位置
    int i=0;
    while(sqlist->data[i]!=x)
        i++;
    if(i>sqlist->length)
        return 0;   //未找到
    else
        return (i+1);
}

int insert_elem(SQLIST *sqlist,elem_type x,int i)
{
    int j;
    if(i<1||i>sqlist->length+1)
        return 0;
    for(j=sqlist->length;j>i;j--)
    {
        sqlist->data[j]=sqlist->data[j-1];
    }
    sqlist->data[i-1]=x;
    (sqlist->length)++;
    return 1;
}

int del_elem(SQLIST *sqlist,int i)
{
    int j;
    if(i<1||i>sqlist->length)
        return 0;
    for(j=i;j<sqlist->length;j++)
        sqlist->data[j-1]=sqlist->data[j];
    sqlist->length--;
    return 1;
}

void disp_list(SQLIST *sqlist)
{
    int i;
    for(i=1;i<=sqlist->length;i++)
        printf("%c ",sqlist->data[i-1]);
    printf("\n");
}

void main()
{
    int i;
    elem_type elem;
    SQLIST sqlist;
    init_list(&sqlist);
    insert_elem(&sqlist,'a',1);
    insert_elem(&sqlist,'b',2);
    insert_elem(&sqlist,'c',3);
    insert_elem(&sqlist,'d',4);
    insert_elem(&sqlist,'e',5);
    insert_elem(&sqlist,'f',6);
    insert_elem(&sqlist,'g',7);

    printf("data diagram:");disp_list(&sqlist);
    printf("length:%d\n",get_length(&sqlist));
    i=3;get_elem(&sqlist,i,&elem);
    printf("the %dth data is:%c\n",i,elem);
    elem='a';
    printf("data %c is number%d\n",elem,locate(&sqlist,elem));
    i=4;printf("delete number %d data\n",i);
    del_elem(&sqlist,i);
    printf("data diagram:");disp_list(&sqlist);


}