李桐枝 25号数据算法一

仲恺农业工程学院实验报告纸信科（院、系）电子专业123 班组课实验一线性表的操作及应用第一部分线性表（顺序表）的操作及应用一、实验目的1、深刻理解线性结构的特点及线性表的概念2、熟练掌握线性表的顺序存储结构及基本运算算法的实现，特别是查找、插入和删除算法二、实验要求1、编写程序实现顺序表的各种运算，并在此基础上设计主函数，使其功能灵活清晰，如通过键盘输入要插入的顺序表的元素，要插入第几个元素也通过用户控制，使其具有如下功能：（1）依次插入元素25，21，46，90，12，99（2）输出顺序表的长度（3）在第2个位置上插入元素44（4）输出顺序表（5）删除顺序表第4个元素（6）再次输出改变的顺序表2、编制一个函数，该函数能在顺序表中查找元素e并返回其位置。

int locate_seq(PSeqList palist){i nt q;for (q = 0; q <= palist -> n - 1; q++){if (palist -> element[q] == e)return q;}}三、程序运算结果截图1.四、程序源代码1.# include <stdio.h># include <malloc.h>struct SeqList{int MAXNUM;int n;int * element;};typedef struct SeqList * PSeqList;PSeqList createNullList_seq(int m){PSeqList palist = (PSeqList)malloc(sizeof(struct SeqList));if (palist != NULL){palist -> element = (int *)malloc(sizeof(int) * m);if (palist -> element){palist -> MAXNUM = m;palist -> n = 0;return palist;}}else free(palist);printf("Out of space!!\n");return NULL;}void insertPre_seq(PSeqList palist){int x;int q;if (palist -> n >= palist -> MAXNUM){printf("Overflow!\n");}printf("输入元素:\n");for (q = 0; q <= 5; q++){scanf("%d", &x);palist -> element[q] = x;palist -> n = palist -> n +1;}}void insertPre_seq2(PSeqList palist, int p, int x){int q;if (palist -> n >= palist -> MAXNUM){printf("Overflow!\n");}if (p < 0 || p > palist -> n){printf("Not exit!\n");}for (q = palist -> n - 1; q >= p; q--)palist -> element[q + 1] = palist -> element[q];palist -> element[p] = x;palist -> n = palist -> n + 1;}void showList1(PSeqList palist){int i;printf("插入后的顺序表:\n");for (i = 0; i < palist -> n; i++)printf("%d ", palist -> element[i]);printf("\n");}void showList2(PSeqList palist){int i;for (i = 0; i <= palist -> n - 1; i++)printf("%d ", palist -> element[i]);printf("\n");}void deleteP_seq(PSeqList palist, int p){int q;if (p < 0 || p > palist -> n - 1){printf("Not exist!\n");}for (q = p; q < palist -> n - 1; q++)palist -> element[q] = palist -> element[q + 1];palist -> n = palist -> n - 1;}int main(void){int x;PSeqList p;p = createNullList_seq(20);insertPre_seq(p);printf("顺序表长度n = %d\n", p -> n);printf("在第2个位置上插入:");scanf("%d", &x);insertPre_seq2(p, 1, x);showList1(p);printf("删除第4个元素后的顺序表:\n");deleteP_seq(p, 3);showList2(p);return 0;}第二部分线性表（链表）的操作及应用一、实验目的1、熟练掌握单链表的组织方法及基本运算的算法2、熟练掌握线性表单链结构上的的查找、插入和删除算法二、实验要求1、编写程序实现单链表的各种运算，并在此基础上设计主函数，使其功能灵活清晰，如通过键盘输入要插入的顺序表的元素，要插入第几个元素也通过用户控制，使其具有如下功能：（1）依次插入元素25，21，46，90，12，45（2）输出链表（3）判断链表中是否存在值为90的元素（4）删除链表中值为21的元素（5）输出链表的长度（6）输出链表2、编制一个函数，能够获取单链表中第i个位置上的元素并输出,在主函数中调用它,能够输出第i个位置上的元素,修改插入函数,利用头插入法实现元素的插入,在主函数中调用该子函数,实现元素的插入三、程序运算结果截图1.2.四、程序源代码1.# include <stdio.h># include <malloc.h>struct Node;typedef struct Node * PNode;struct Node{int info;PNode link;};typedef struct Node * LinkList;LinkList insertPost_link(void){int i;PNode head = NULL, tail, pNew;for (i = 0; i <= 5; i++){pNew = (PNode)malloc(sizeof(struct Node));scanf("%d", &pNew -> info);pNew -> link = NULL;if (i == 0)head = pNew;elsetail -> link = pNew;tail = pNew;}return head;}void search(PNode p, int x){while (p != NULL && p -> info != 90)p = p -> link;if (p == NULL)printf("不存在%d的元素\n", x);elseprintf("存在%d的元素\n", x);}LinkList deleteV(PNode p, int x){PNode q = p;if (p == NULL){printf("fail!\n");}else if (p -> info == x){p = p -> link;return p;}else{while (p -> link != NULL && p -> link -> info != x) p = p -> link;if (p -> link == NULL){printf("Not exit!\n");}elsep -> link = p -> link -> link;return q;}}void show(LinkList p){while (p){printf("%d ", p -> info);p = p -> link;}printf("\n");}void length(LinkList p){int n = 0;while(p){n++;p = p -> link;}printf("链表长度n = %d\n", n);}int main(){LinkList h = insertPost_link();printf("输出链表:\n");show(h);search(h, 90);h = deleteV(h, 21);printf("删除后的链表：\n");show(h);length(h);return 0;}2.# include <stdio.h># include <malloc.h>struct Node;typedef struct Node * PNode;struct Node{int info;PNode link;};typedef struct Node * LinkList;//头插入法实现元素的插入LinkList insertPre_link(void){PNode head, pNew;for (int i = 0; i <= 5; i++){pNew = (PNode)malloc(sizeof(struct Node));scanf("%d", &pNew -> info);if (i == 0)pNew -> link = NULL;elsepNew -> link = head;head = pNew;}return head;}//获取单链表中第i个位置上的元素void search_out(LinkList p, int i){int n = 0;while (p){n++;if (n == i)printf("第%d个元素是:%d", n, p -> info);elsep = p -> link;}printf("\n");}void show(LinkList p){while (p){printf("%d ", p -> info);p = p -> link;}printf("\n");}int main(){int i;printf("输入6个元素(头插入)：");LinkList h = insertPre_link();printf("输出链表:\n");show(h);printf("输入要查找的第i个元素: i = ");scanf("%d", &i);search_out(h, i);//输出第i个位置的元素return 0;}。