静态顺序表的实现

静态顺序表能实现数据的头插、头删，尾插、尾删，显示，指定位的插入，指定位的删除，指定元素的删除，指定元素的查找，逆序写入的元素，排序以及二分查找等功能。代码实现如下：

SeqList.h

#ifndef __SEQLIST_H__
#define __SEQLIST_H__

#include <stdio.h>
#include <assert.h>
#include <string.h>

#define MAX 10

typedef int DataType;

typedef struct SeqList
{
    DataType data[MAX];
    int sz;
}SeqList, *pSeqList;

void InitSeqList(pSeqList ps);
void PushBack(pSeqList ps, DataType d);
void PopBack(pSeqList ps);
void Display(const pSeqList ps);
void PushFront(pSeqList ps, DataType d);
void PopFront(pSeqList ps);
int Find(pSeqList ps, DataType d);
void Insert(pSeqList ps, DataType d, int pos);
void Remove(pSeqList ps, DataType d);
void RemoveAll(pSeqList ps, DataType d);
void Reverse(pSeqList ps);
void Sort(pSeqList ps);
int BinarySearch(pSeqList ps, DataType d);
#endif //__SEQLIST_H__

SeqList.c
#include"SeqList.h"
void InitSeqList(pSeqList ps)//初始化
{
    ps->sz = 0;
    memset(ps->data, 0, sizeof(ps->data));
}
void PushBack(pSeqList ps, DataType d)//尾部压栈
{
    assert(ps != NULL);
    if (ps->sz == MAX)
    {
        return;
    }
        ps->data[ps->sz] = d;
        ps->sz++;
}
void PopBack(pSeqList ps)//尾部删除
{
    assert(ps != NULL);
    ps->sz--;
}
void Display(const pSeqList ps)//显示函数
{
    int i = 0;
    for (i = 0; i < ps->sz; i++)
    {
        printf("%d ", ps->data[i]);
    }
    printf("\n");
}
void PushFront(pSeqList ps, DataType d)//头部插入
{
    assert(ps != NULL);
    int i = 0;
    if (ps->sz == MAX)
    {
        return;
    }
    else
    {
        for (i = ps->sz; i > 0; i--)
        {
            ps->data[i] = ps->data[i - 1];
        }
    }
    ps->data[0] = d;
    ps->sz++;
}
void PopFront(pSeqList ps)//头部删除
{
    assert(ps != NULL);
    int i = 0;
    if (ps->sz == 0)
    {
        return;
    }
    for (i = 0; i < ps->sz;i++)
    {
        ps->data[i] = ps->data[i + 1];
    }
    ps->sz--;
}
int Find(pSeqList ps, DataType d)//查找函数
{
    assert(ps != NULL);
    int i = 0;
    for (i = 0; i < ps->sz; i++)
    {
        if (ps->data[i] == d)
            return i;
    }
    return -1;
}
void Insert(pSeqList ps, DataType d, int pos)//位置插入函数
{
    assert(ps != NULL);
    int i = 0;
    if (ps->sz == MAX)
    {
        return;
    }
    for (i = ps->sz; i > pos; i--)
    {
        ps->data[i] = ps->data[i - 1];
    }
    ps->data[pos - 1] = d;
    ps->sz++;

}
void Remove(pSeqList ps, DataType d)//删除你要删的第一个出现的元素
{
    assert(ps != NULL);
    int pos= Find( ps, d);
    if (pos!= -1)
    {
        for (; pos < ps->sz; pos++)
        {
            ps->data[pos] = ps->data[pos + 1];  
        }
        ps->sz--;
    }
}
void RemoveAll(pSeqList ps, DataType d)//删除所有你要删除的那个元素
{
    int i = 0;
    assert(ps != NULL);
    i = (Find(ps, d)&&(i!=-1));
    for (; i < ps->sz; i++)
    {
        {
            Remove(ps, d);
        }
    }
}
void Reverse(pSeqList ps)  //逆序
{
    assert(ps != NULL);
    DataType*left = ps->data; //left地址
    DataType*right = ps->data + ps->sz - 1; //right地址
    while(left < right)
    {
        DataType tmp = *left;
        *left = *right;
        *right = tmp;
        left++;
        right--;
    }
}
void Sort(pSeqList ps)  //排序，冒泡排序
{
    assert(ps != NULL);
    int i = 0;
    int j = 0;
    for (i = 0; i < ps->sz - 1; i++)
    {
        for (j = 0; j < ps->sz - 1 - i; j++)
        {
            if (ps->data[j]>ps->data[j + 1])
            {
                DataType tmp = ps->data[j];
                ps->data[j] = ps->data[j + 1];
                ps->data[j + 1] = tmp;
            }
        }
    }
}
int BinarySearch(pSeqList ps, DataType d)//二分查找
{
    assert(ps != NULL);
    int left = 0;
    int right = (ps->sz)-1;
    int mid = left + (right - left) / 2;
    while (left <= right)
    {
        if (ps->data[mid] > d)
        {
            right = mid - 1;
        }
        if (ps->data[mid] < d)
        {
            left = mid + 1;
        }
        if (ps->data[mid] == d)
        {
            return mid;
        }
    }
    return -1;
}

test.c
#define _CRT_SECURE_NO_WARNINGS 1
#include"SeqList.h"
void menu()
{
    printf("***********************\n");
    printf("****    1 test1   ****\n");
    printf("****    2 test2   ****\n");
    printf("****    0 Exit  ****\n");
}
void test1()
{
    SeqList my_List;
    InitSeqList(&my_List);
    PushBack(&my_List, 1);
    PushBack(&my_List, 2);
    PushBack(&my_List, 3);
    PushBack(&my_List, 4);
    Display(&my_List);
    PopBack(&my_List);
    Display(&my_List);
    PopBack(&my_List);
    Display(&my_List);
    PopBack(&my_List);
    Display(&my_List);
    PopBack(&my_List);
    Display(&my_List);
    /*PopBack(&my_List);
    Display(&my_List);*/
    PushFront(&my_List, 1);
    Display(&my_List);
    PushFront(&my_List, 2);
    Display(&my_List);
    PushFront(&my_List, 3);
    Display(&my_List);
    PushFront(&my_List, 4);
    Display(&my_List);
    PushFront(&my_List, 4);
    Display(&my_List);
    /*int j=Find(&my_List, 1);
    if (j == -1)
    {
        printf("找不到");
    }
    else
    {
        printf("%d\n", j);
    }*/
    /* 
    /*Insert(&my_List, 5, 2);
    Display(&my_List);*/
    RemoveAll(&my_List, 4);
    Display(&my_List);
    /*int ret = BinarySearch(&my_List, 2);
        printf("%d\n", ret);*/
    /*Display(&my_List);*/
    RemoveAll(&my_List, 1);
    Display(&my_List);
    /*Sort(&my_List);
    Display(&my_List);*/
}
void test2()
{
    SeqList my_List;
    InitSeqList(&my_List);
    PushBack(&my_List, 1);
    PushBack(&my_List, 2);
    PushBack(&my_List, 3);
    PushBack(&my_List, 4);
    PushBack(&my_List, 5);
    PushBack(&my_List, 5);
    Display(&my_List);
    PopBack(&my_List);
    Display(&my_List);
    PopBack(&my_List);
    Display(&my_List);
    PopBack(&my_List);
    Display(&my_List);
    PopBack(&my_List);
    Display(&my_List);
    Sort(&my_List);
    Display(&my_List);
    Reverse(&my_List);
    Display(&my_List);
}
    int main()
    {
        int input = 0;
        do{
            menu();
            printf("请选择： ");
            scanf("%d", &input);
            switch (input)
            {
            case 0:
                break;
            case 1:
                test1();
                break;
            case 2:
                test2();
                break;
            }
        } while (input);
    system("pause");
    return 0;
}