//顺序表的插入、删除、查找操作实现
#include<stdio.h>
#include<stdlib.h>
#define InitSize 10
#define MaxSize 50
//#define bool int
//#define true 1
//#define false 0
typedef int ElemType;
typedef struct
{
ElemType *data;
int length;
}SqList;
//插入操作,
void ListInsert(SqList &L,int i,ElemType e)
{
if(i<1 || i>L.length+1)
// return 0;
if(L.length >= MaxSize)
// return 0;
for(int j=L.length;j>=i;j--)
L.data[j] = L.data[j-1];
L.data[i-1] = e;
L.length++;
printf("%d\n",L.data[i-1]);
//return 1;
}
//删除操作
void ListDelete(SqList &L,int i)
{
if(i<1 || i>L.length)
// return 0;
for(int j=i; j<L.length; j++)
L.data[j-1] = L.data[j];
L.length--;
printf("%d\n",L.data[i-1]);
//return 1;
}
//按值查询
int LocateElem(SqList L,ElemType e)
{
int i;
for(i=0; i<L.length; i++)
if(L.data[i] == e)
return i+1; //返回元素e的位号
return 1000; //退出循环,说明查找失败
}
void main()
{
SqList L;
int c;
L.data = (ElemType*)malloc(sizeof(ElemType)*InitSize); //初始化的动态分配
ListInsert(L,8,9);
ListDelete(L,8);
c = LocateElem(L,9);
printf("%d\n",c);
}
运行结果: