顺序表

//MyList.h

#ifndef MYLIST_H
#define MYLIST_H

#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 20
typedef int ElemType; 

typedef struct
{
	ElemType a[MAXSIZE];
	int length;
}SqList;

void creat_list(SqList *L);//创建
void out_list(SqList L);//Output the list
void insert_sq(SqList *L,int i,ElemType e);//按位置插入元素
void insertE(SqList *L,ElemType e);原数列递增，插入一个元素，继续保持递增
ElemType delete_sq(SqList *L,int i);//删除指定位置的元素
int locat_sq(SqList L, ElemType e);//查找为e的原始，返回它的位置
void swap(ElemType &x,ElemType &y);//对换两个数的
void mergeList_Sq(SqList La,SqList Lb,SqList *Lc);//合并两个数列
void reverse_Sq(SqList *L);//数列逆置
ElemType getE(SqList La,int i);//获得数列的第i个元素

#endif

MyList.cpp

//MyList.cpp

#include<stdio.h>
#include<stdlib.h>
#include "MyList.h"

void creat_list(SqList *L)//Creat sa list
{
	int i;
	printf("\n n=");scanf("%d",&L->length);
	for(i=0;i<L->length;i++)
	{
		printf("\n data %d=",i);//scanf("%d",&i);}
		scanf("%d",&(L->a[i]));
	}
}

void out_list(SqList L)//Output the list
{
	int i; 
	printf("\n");
	for(i=0;i<=L.length-1;i++) printf("%10d",L.a[i]);
}

/**********************检测完毕*****************************3**/
void insert_sq(SqList *L,int i,ElemType e)//Insert a element 
{ 
	int j;
	if (L->length==MAXSIZE) printf("\n overflow !");
	else if(i<1||i>L->length+1)  printf("\n erroe i !");
	else { for(j=L->length-1; j>=i-1; j--) L->a[j+1]=L->a[j]; 
	/* Move the element backward */
	L->a[i-1]=e;                    /* Insert the element     */ 
	L->length++;                    /* The length of list add 1 */
	}
}

/**********************检测完毕****************************4***/
ElemType delete_sq(SqList *L, int i)//delet a element and return it
{
	ElemType x; int j;
	if( L->length==0) printf("\n  It's a empty list. underflow !");
	else if(i<1||i> L->length){ printf("\n error i !");
	x=-1;}
	else {   x=L->a[i-1];
	for(j=i; j<=L->length-1; j++) L->a[j-1]=L->a[j];
	L->length--;
	}
	return(x);
}

/********************检测完毕******************************5***/
int locat_sq(SqList L, ElemType e) //Find a element and return its position
{ 
	int i=0;
	while(i<=L.length-1 && L.a[i]!=e) i++;
	if(i<=L.length-1)  return(i+1);
	else return(-1);
}

/******************检测完毕*******************************6****/
void mergeList_Sq(SqList La,SqList Lb,SqList *Lc)//merge two list
{
	int *pa,*pb,*pc,*pa_last,*pb_last;
	pa=La.a; pb=Lb.a;pc=Lc->a;
	Lc->length=La.length+Lb.length;

	pa_last=La.a+La.length-1;
	pb_last=Lb.a+Lb.length-1;
	while(pa<=pa_last && pb<=pb_last)
	{
		if(*pa<=*pb) *pc++=*pa++;
		else *pc++=*pb++;
	}
	while(pa<=pa_last)  *pc++=*pa++;
	while(pb<=pb_last)  *pc++=*pb++;
}

/********************检测完毕*********************************7*******/
void swap(ElemType &x,ElemType &y)
{
	ElemType p;
	p=x;x=y;y=p;
}
/********************检测完毕****************************8*****/
void reverse_Sq(SqList *L)//Reverse the list逆置
{
	int i,j,k;
	i=0;j=L->length-1;
	k=(L->length-1)/2;
	//ElemType s;
	while(i<=k  && j>=k)
	{
		swap(L->a[i],L->a[j]);
		++i;--j;
	}

}

/********************检测完毕*****************************9****/
void insertE(SqList *L,ElemType e)
{//Insert a element to the stadily increase list and keep the list increaseing
	int j,i,k;
	k=L->length;
	if (L->length==MAXSIZE) printf("\n overflow !");
	else
	{
		L->a[k]=e; ++L->length;
		for(i=k;i>0;i--)
		{
			if(L->a[i]<L->a[i-1])
				swap(L->a[i],L->a[i-1]);
		}
	}

}

/*******************检测完毕*******************************10***/
ElemType getE(SqList La,int i)
{
	ElemType e;
	int j;
	if(i<1||i>La.length+1)printf("**error**\n");
	else
	{e=La.a[i-1];
	}
	return e;
}

/

测试文件 ListTest.cpp

//ListTest.cpp

#include <stdio.h> 
#include <stdlib.h>
#include "MyList.h"

SqList  a,b,c,lc,d;

void main()
{ 
	int i,k,loc,m; ElemType e,x,en; 
	do { 
		printf("\n     1. 建立线性表 " );
		printf("\n     2. 在i位置插入元素e");
		printf("\n     3. 删除第i个元素，返回其值");
		printf("\n     4. 查找值为 e 的元素");
		printf("\n     5.合并链条链表");
		printf("\n     6.数组倒置");
		printf("\n     7.在递增的数组中插入一个数，保持数组递增");
		printf("\n     8.获取第i个元素");
		printf("\n     9. 结束程序运行");
		printf("\n======================================");
		printf("\n    请输入您的选择（1，2，3，4，5,6,7,8,9）");
		scanf("%d",&k);
		switch(k)
		{ case 1:{ creat_list(&a);  out_list(a);
		} break;
		case 2:{ printf("\n插入的位置 i="); scanf("%d",&i);
			printf("\t\t插入的元素 e="); scanf("%d",&e);
			insert_sq(&a,i,e);   out_list(a);
			   } break;
		case 3:{ printf("\n i=");  scanf("%d",&i);
			x=delete_sq(&a,i);  out_list(a);
			printf("\n x=%d",x);
			   } break;
		case 4:{ printf("\n e="); scanf("%d",&e);
			loc=locat_sq(a,e);
			if (loc==-1) printf("\n 未找到 %d",loc);
			else printf("\n 已找到，元素位置是 %d",loc);
			   } break;
		case 5:{creat_list(&b); out_list(b);
			mergeList_Sq(a,b,&lc); out_list(lc);
			   }break;
		case 6:{
			reverse_Sq(&a); out_list(a);
			   }break;
		case 7:{printf("\n输入递增数组："); creat_list(&d);
			out_list(a);
			printf("插入数组 \n e=");scanf("%d",&e);
			insertE(&d,e); out_list(d);      
			   }break;
		case 8:{printf("第几个元素 m=");scanf("%d",&m);
			en=getE(a,m);printf("你要找的元素是：%d\n",en);
			   }
		} 
	}while(k!=9);
	printf("\n               再见！");
	printf("\n          打回车键，返回。"); 
}