#include
#include
typedef struct //定义顺序表
{
int* data;
int length;
int maxSize;
}SqlList;
void IniSql(SqlList &L) //顺序表初始化
{
L.data = (int *)malloc(10*sizeof(int));
L.length = 0;
L.maxSize = 10;
for(int i = 0; i=L.maxSize)
return false;
L.data[L.length] = e;
L.length++;
return true;
}
bool insertSql(SqlList &l, int i, int e)//插入元素
{
if(i<1 || i>l.length+1 || l.length>=l.maxSize)
return false;
for(int j=l.length-1; j>=i-1; j--) //可以插到最后一个数的后面
{
l.data[j+1] = l.data[j];
}
l.data[i-1] = e;
l.length++;
return true;
}
bool deletSql(SqlList &L, int i, int &e)
{
if(i<1 || i>L.length)
return false;
e = L.data[i-1];
for(int j=i; j<=L.length; j++)
{
L.data[j-1] = L.data[j];
}
L.length--;
return true;
}
int serchSql(SqlList &L, int e)//按值查找
{
for (int i=0; i