线性表的基本操作

实验二线性表的基本操作一、实验目的1．掌握用C++/C语言调试程序的基本方法。

2．掌握线性表的顺序存储和链式存储的基本运算，如插入、删除等。

二、实验要求1．C++/C完成算法设计和程序设计并上机调试通过。

2．撰写实验报告，提供实验结果和数据。

3．分析算法，要求给出具体的算法分析结果，包括时间复杂度和空间复杂度，并简要给出算法设计小结和心得。

三、实验内容：1.分析并运行以下各子程序的主要功能。

程序1：顺序存储的线性表和运算#include<stdio.h>#define MAXSIZE 100int list[MAXSIZE];int n;/*insert in a seqlist*/int sq_insert(int list[], int *p_n, int i, int x){int j;if (i<0 || i>*p_n) return(1);i f (*p_n==MAXSIZE) return(2);for (j=*p_n+1; j>i; j--)list[j]=list[j-1];list[i]=x;(*p_n)++;return(0);}/*delete in a seq list*/int sq_delete(int list[], int *p_n, int i){int j;i f (i<0 || i>=*p_n) return(1);for (j = i+1; j<=*p_n; j++)list[j-1] = list[j];(*p_n)--;return(0);}void main(){int i,x,temp;p rintf("please input the number for n\n");printf("n=");scanf("%d",&n);for (i=0; i<=n; i++){printf("list[%d]=",i);scanf("%d",&list[i]);}p rintf("The list before insertion is\n");f or (i=0; i<=n; i++) printf("%d ",list[i]);printf("\n");p rintf("please input the position where you want to insert a value\nposition=");scanf("%d",&i);p rintf("please input the value you want to insert.\nx=");scanf("%d",&x);t emp=sq_insert(list,&n,i,x);switch(temp){case 0:printf("The insertion is successful!\n");printf("The list is after insertion is\n");for(i=0; i<=n; i++) printf("%d ",list[i]);printf("\n");printf("%d\n",n);break;case 1:c ase 2:printf("The insertion is not successful!\n");break;}/*deleting*/p rintf("The list before deleting is\n");f or (i=0; i<=n; i++) printf("%d ",list[i]);printf("\n");p rintf("please input the position where you want to delete a value\nposition=");scanf("%d",&i);t emp=sq_delete(list,&n,i);switch(temp){case 0:printf("The deleting is successful!\n");printf("The list is after deleting is\n");for(i=0; i<=n; i++) printf("%d ",list[i]);printf("\n");printf("%d",n);break;c ase 1:printf("The deleting is not successful!");break;}}2.分析并运行以下各子程序的主要功能。

程序2链式存储的线性表和运算#include<stdio.h>#include<malloc.h>struct node{char data;struct node *next;};typedef struct node NODE;/*This function creates a link_list with N nodes.*/NODE *create_link_list(int n){int i;NODE *head, *p, *q;if (n==0) return NULL;h ead = (NODE *) malloc(sizeof(NODE));p = head;printf("Please input %d chars for the link list\n",n);for (i=0; i<n; i++){scanf("%c ", &(p->data));q=(NODE *)malloc(sizeof(NODE));printf("test3\n");p->next=q;p=q;}scanf("%c ",&(p->data));getchar();p->next=NULL;return (head);}/*This function inserts a node whose value is b*//*before the node whose value is a, if the node is not exist,*/ /*then insert it at the end of the list*/void insert(NODE **p_head, char a, char b){NODE *p, *q;q = (NODE *)malloc(sizeof(NODE));q->data = b;q->next =NULL;i f (* p_head == NULL) * p_head = q;else{p=(NODE*)malloc(sizeof(NODE));p = * p_head;while (p->data != a && p->next != NULL)p = p->next;q->next = p->next;p->next = q;}}/*The function deletes the node whose value is a,*//*if success, return 0, or return 1*/int deletenode(NODE **p_head, char a){NODE *p, *q;q=*p_head;if (q==NULL) return(1);if (q->data == a){* p_head = q->next;free(q);return (0);}else{while (q->data != a && q->next != NULL){p = q;q = q->next;}if (q->data == a){p->next = q->next;free(q);return(0);}else return(1);}}void main(){ NODE *my_head,*p;/* create a link list with m nodes */int m;char ch_a,ch_b;p rintf("please input the number of nodes for the link_list\nm=");scanf("%d",&m);getchar();printf("test1\n");m y_head = (NODE *) malloc(sizeof(NODE));m y_head=create_link_list(m);/*Output the link list*/p rintf("The link list is like:\n");p=my_head;while (p != NULL){printf("%c ",p->data);p=p->next;}printf("\n");/*insert a node whose value is b before a*/p rintf("Please input the position for a\n ch_a=");getchar();scanf("%c",&ch_a);getchar();p rintf("Please input the value that you want to insert\n ch_b=");scanf("%c",&ch_b);getchar();i nsert(&my_head,ch_a,ch_b);p rintf("The link list after insertion is like:\n");p=my_head;while (p != NULL){printf("%c ",p->data);p=p->next;}printf("\n");/*delete a node whose value is a*/p rintf("Please input the position for a a=");scanf("%c",&ch_a);getchar();d eletenode(&my_head,ch_a);p rintf("The link list after deleting is like:\n");p=my_head;while (p != NULL){printf("%c ",p->data);p=p->next;}printf("\n");}3.运行以下程序并分析各子函数的主要功能。