数据结构 - 线性表之顺序表 （c 语言）

SeqList.h

#ifndef _SEQLIST_H_
#define  _SEQLIST_H_

#include "stdio.h"
#include "malloc.h"
#include "assert.h"

#define SEQLIST_INIT_SIZE 8
typedef int ElemType;

typedef struct SeqList
{
	ElemType *base;
	int		 capacity;  //容量  
	int      size;  //大小 

}SeqList;

void InitSeqList(SeqList *list);
void push_back(SeqList *List, ElemType);
void push_front(SeqList *List, ElemType);
void show_list(SeqList*List);
void pop_back(SeqList * List);
void pop_front(SeqList *List);
void insert_pos(SeqList* List, int, ElemType);
int find(SeqList *List, ElemType);
int length(SeqList *List);
void delete_pos(SeqList*List, int pos);
void delete_val(SeqList*List, ElemType x);
void sort(SeqList*List);
void resver(SeqList *List);
void clear(SeqList *List);
void destroy(SeqList* List);
#endif // !_SEQLIST_H_

SeqList.c

#include "SeqList.h"

void InitSeqList(SeqList *list)
{
	list->base = (ElemType *)malloc(sizeof(ElemType)*SEQLIST_INIT_SIZE);
	assert(list->base != NULL);
	list->capacity = SEQLIST_INIT_SIZE;
	list->size = 0;

}

void push_back(SeqLis