3周项目 顺序表的基本运算

文件名称：项目一顺序表的基本运算.cpp

*作 者：泮春宇

 *完成日期：2016年9月22日

 *版 本 号：v1.0 *

*问题描述：实现顺序表基本运算有算法，依据“最小化”的原则进行测试。所谓最小化 原则，指的是利用尽可能少的基本运算，组成一个程序，并设计main函数 完成测试。

*输入描述：无

 *程序输出：依据各个函数而定

 

<p>#include <stdio.h>#include <malloc.h>#define MaxSize 50typedef int ElemType;typedef struct{ ElemType data[MaxSize]; int length;</p><p>}SqList;void CreatList(SqList *&L,ElemType a[],int n);void DisList(SqList *L);bool ListEmpty(SqList *L);int main(){ SqList *sq; ElemType x[6]={5,8,7,2,4,9}; CreatList(sq,x,6); DisList(sq); return 0;}void CreatList(SqList *&L,ElemType a[],int n){ int i; L=(SqList *)malloc(sizeof(SqList)); for(i=0;i<n;i++) {  L->data[i]=a[i]; } L->length=n;</p><p>}void DisList(SqList *L){ int i; if(ListEmpty(L))  return; for(i=0;i<L->length;i++)  printf("%d ",L->data[i]); printf("\n");</p><p>}bool ListEmpty(SqList *L){return (L->length==0);</p><p>}</p><p><img src="http://img.blog.csdn.net/20160918103044103?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" /></p><p>知识点总结：</p><p>初步认识了解了顺序表的几种基本运算。</p><p><span style="font-family:'microsoft yahei';font-size:14px;color:#555555;LINE-HEIGHT: 35px">代码2：</span></p><p><pre class="cpp" name="code">#include <stdio.h>#include <malloc.h>#define MaxSize 50   typedef int ElemType;  typedef struct{    ElemType data[MaxSize];      int length;} SqList;void CreateList(SqList *&L, ElemType a[], int n);void DispList(SqList *L);bool ListEmpty(SqList *L);int ListLength(SqList *L);bool GetElem(SqList *L,int i,ElemType &e); int LocateElem(SqList *L, ElemType e); int main(){    SqList *sq;    ElemType x[6]= {5,8,7,2,4,9};    ElemType a;    int loc;    CreateList(sq, x, 6);    DispList(sq);    printf("表长度:%d\n", ListLength(sq));      if(GetElem(sq, 3, a))          printf("找到了第3个元素值为:%d\n", a);    else        printf("第3个元素超出范围!\n");    if(GetElem(sq, 15, a))          printf("找到了第15个元素值为:%d\n", a);    else        printf("第15个元素超出范围!\n");    if((loc=LocateElem(sq, 8))>0)  //测试能找到的情形        printf("找到了，值为8的元素是第 %d 个\n", loc);    else        printf("值为8的元素没有找到!\n");    if((loc=LocateElem(sq, 17))>0)  //测试不能找到的情形        printf("找到了，值为17的元素是第 %d 个\n", loc);    else        printf("值为17的元素没有找到!\n");    return 0;}void CreateList(SqList *&L, ElemType a[], int n){    int i;    L=(SqList *)malloc(sizeof(SqList));    for (i=0; i<n; i++)        L->data[i]=a[i];    L->length=n;}void DispList(SqList *L){    int i;    if (ListEmpty(L))        return;    for (i=0; i<L->length; i++)        printf("%d ",L->data[i]);    printf("\n");}bool ListEmpty(SqList *L){    return(L->length==0);}int ListLength(SqList *L){    return(L->length);}bool GetElem(SqList *L,int i,ElemType &e){    if (i<1 || i>L->length)        return false;    e=L->data[i-1];    return true;}int LocateElem(SqList *L, ElemType e){    int i=0;    while (i<L->length && L->data[i]!=e) i++;    if (i>=L->length)        return 0;    else        return i+1;}

 

运行结果：

 

代码3：

#include <stdio.h>#include <malloc.h>#define MaxSize 50   typedef int ElemType;  typedef struct{    ElemType data[MaxSize];      int length;} SqList;void CreateList(SqList *&L, ElemType a[], int n);void DispList(SqList *L);bool ListEmpty(SqList *L);int ListLength(SqList *L);bool GetElem(SqList *L,int i,ElemType &e); int LocateElem(SqList *L, ElemType e); bool ListInsert(SqList *&L,int i,ElemType e);void InitList(SqList *&L);int main(){    SqList *sq;    InitList(sq);    ListInsert(sq, 1, 5);    ListInsert(sq, 2, 3);    ListInsert(sq, 1, 4);    DispList(sq);    return 0;}void CreateList(SqList *&L, ElemType a[], int n){    int i;    L=(SqList *)malloc(sizeof(SqList));    for (i=0; i<n; i++)        L->data[i]=a[i];    L->length=n;}void DispList(SqList *L){    int i;    if (ListEmpty(L))        return;    for (i=0; i<L->length; i++)        printf("%d ",L->data[i]);    printf("\n");}bool ListEmpty(SqList *L){    return(L->length==0);}int ListLength(SqList *L){    return(L->length);}bool GetElem(SqList *L,int i,ElemType &e){    if (i<1 || i>L->length)        return false;    e=L->data[i-1];    return true;}int LocateElem(SqList *L, ElemType e){    int i=0;    while (i<L->length && L->data[i]!=e) i++;    if (i>=L->length)        return 0;    else        return i+1;} //初始化线性表void InitList(SqList *&L){L=(SqList *)malloc(sizeof(SqList));L->length=0;}//插入数据元素bool ListInsert(SqList *&L,int i,ElemType e){int j;if(i<1||i>L->length+1)return false;i--;for(j=L->length;j>i;j--)L->data[j]=L->data[j-1];L->data[i]=e;L->length++;return true;}

运行结果：