c语言头文件顺序表,有序顺序表的插入

[c]代码库//库函数头文件包含

#include

#include

#include

//函数状态码定义

#define TRUE 1

#define FALSE 0

#define OK 1

#define ERROR 0

#define INFEASIBLE -1

#define OVERFLOW -2

typedef int Status;

//顺序表的存储结构定义

#define LIST_INIT_SIZE 100

#define LISTINCREMENT 10

typedef int ElemType; //假设线性表中的元素均为整型

typedef struct{

ElemType* elem; //存储空间基地址

int length; //表中元素的个数

int listsize; //表容量大小

}SqList; //顺序表类型定义

//函数声明

Status ListInsert_SortedSq(SqList &L, ElemType e)

{

int i;

ElemType *newelem;

if(L.length>=L.listsize)//扩容

{

newelem=(ElemType *)realloc(L.elem,(L.listsize+LISTINCREMENT)*sizeof(ElemType));

if(!newelem)exit(OVERFLOW);

L.elem=newelem;

L.listsize+=LISTINCREMENT;

}

for(i=L.length-1;i>=0&&*(L.elem+i)>e;i--)

L.elem[i+1]=L.elem[i];

L.elem[i+1]=e;

L.length++;

return OK;

}

//顺序表初始化函数

Status InitList_Sq(SqList &L)

{

//开辟一段空间

L.elem = (ElemType*)malloc(LIST_INIT_SIZE * sizeof(ElemType));

//检测开辟是否成功

if(!L.elem){

exit(OVERFLOW);

}

//赋值

L.length = 0;

L.listsize = LIST_INIT_SIZE;

return OK;

}

//顺序表输出函数

void ListPrint_Sq(SqList L)

{

ElemType *p = L.elem;//遍历元素用的指针

for(int i = 0; i < L.length; ++i){

if(i == L.length - 1){

printf("%d", *(p+i));

}

else{

printf("%d ", *(p+i));

}

}

}

int main()

{

//声明一个顺序表

SqList L;

//初始化顺序表

InitList_Sq(L);

int number = 0;

ElemType e;

scanf("%d", &number);//插入数据的个数

for(int i = 0; i < number; ++i)

{

scanf("%d", &e);//输入数据

ListInsert_SortedSq(L, e);

}

ListPrint_Sq(L);

return 0;

}