定义:
顺序表是在计算机内存中以数组的形式保存的线性表,是指用一组地址连续的存储单元依次存储数据元素的线性结构。线性表采用顺序存储的方式存储就称之为顺序表。顺序表是将表中的结点依次存放在计算机内存中一组地址连续的存储单元中。
实现:
SeqList.h
#define _CRT_SECURE_NO_WARNINGS 1
#ifndef __SEQLIST_H_
#define __SEQLIST_H_
#include <string.h>
#include <stdio.h>
#include <assert.h>
typedef int DateType;
#define MAX 100
typedef struct SeqList
{
DateType date[MAX];
int sz;//有效元素个数
}SeqList,*pSeqList;
void InitSeqList(pSeqList pList);
void PushBack(pSeqList pList,DateType d);
void PopBack(pSeqList pList);
void PushFront(pSeqList pList,DateType d);
void PopFront(pSeqList pList);
int Find(pSeqList pList,DateType d);
void Remove(pSeqList pList,DateType d);
void RemoveALL(pSeqList pList,DateType d);
void BubbleSort(pSeqList pList);
int BinarySearch(pSeqList pList,DateType d);
//非递归实现
void PrintSeqList(pSeqList pList);
void Insert(pSeqList pList,int pos,DateType d);
void ReverseList(pSeqList plist);
//void DestroySeqList(pSeqList plist);
#endif __SEQLIST_H_
SeqList.c
#define _CRT_SECURE_NO_WARNINGS 1
#include "SeqList.h"
void InitSeqList(pSeqList pList)
{
assert(pList);
pList->sz=0;
memset(pList->date,