c语言实现顺序表简单易懂

#include <stdio.h>
#define MaxSize 100
typedef struct list
{
int Size,MaxSeqList;
int a[MaxSize];
}SeqList;
void CreateList(SeqList *lst,int maxsize)/*初始化顺序表*/
{
lst->Size=0;
lst->MaxSeqList=maxsize;
}
void Clear(SeqList *lst)/*清空顺序表表*/
{
lst->Size=0;
}
bool IsEmpty(SeqList lst)/*判断顺序表是否为空*/
{
return lst.Size==0;
}
bool IsFull(SeqList lst)/*判断顺序表表是否已满*/
{
return lst.Size==lst.MaxSeqList;
}
bool Replace(SeqList *lst,int pos,int x)/*更新顺序表表的第pos个数据元素*/
{
if(pos<0||pos>=lst->Size)
{
printf("Out of bounds!");
return false;