线性表的基本操作讲解

{int j;
if (i<0 || i>*p_n) return(1);
if (*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*/
/*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*/
实验二线性表的基本操作
一、实验目的
1．掌握用C++/C语言调试程序的基本方法。
2．掌握线性表的顺序存储和链式存储的基本运算，如插入、删除等。
二、实验要求
1．C++/C完成算法设计和程序设计并上机调试通过。
2．撰写实验报告，提供实验结果和数据。
3．分析算法，要求给出具体的算法分析结果，包括时间复杂度和空间复杂度，并简要给出算法设计小结和心得。
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;
for (i=0; i<=n; i++) printf("%d ",list[i]);
printf("\n");
printf("please input the position where you want to insert a value\nposition=");
scanf("%d",&i);
/*deleting*/
printf("The list before deleting is\n");
for (i=0; i<=n; i++) printf("%d ",list[i]);
printf("\n");
printf("please input the position where you want to delete a value\nposition=");
int sq_delete(int list[], int *p_n, int i)
{int j;
if (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()
三、实验内容：
1.分析并运行以下各子程序的主要功能。
程序1：顺序存储的线性表和运算
#include<stdio.h>
#define MAXSIZE 100
int list[MAXSIZE];
int n;
/*insert in a seqlist*/
int sq_insert(int list[], int *p_n, int i, int x)
scanf("%d",&i);
temp=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;
case 1:printf("The deleting is not successful!");break;}
}
2.分析并运行以下各子程序的主要功能。
程序2链式存储的线性表和运算
#include<stdio.h>
#include<malloc.h>
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:
case 2:printf("The insertion is not successful!\n");break;}
printf("please input the value you want to insert.\nx=");
scanf("%d",&x);
temp=sq_insert(list,&n,i,x);
switch(temp)
{case 0:printf("The insertion is successful!\n");
{int i,x,temp;
printf("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]);}
printf("The list before insertion is\n");
{scanf("%c ", &(p->data));
q=(NODE *)malloc(sizeof(NODE));
printf("test3\n");
p->next=q;
p=q;}
scanf("%c ",&(p->data));
getchar();
p->next=;
return (head);}
NODE *head, *p, *q;
if (n==0) return NULL;
head = (NODE *) malloc(sizeof(NODE));
p = head;
printf("Please input %d chars for the link list\n",n);
for (i=0; i<n; i++)