静态顺序表的增、删、查、改

头文件：包含一些函数的声明，即一些对顺序表的一些操作！！！

#define _CRT_SECURE_NO_WARNINGS 1
#pragma once
#include<stdio.h>
#include<stdlib.h>


#define MAX_SIZE 10

typedef char SeqListType;//定义了结构体数组的类型char
typedef struct SeqList//结构体名字
{
    SeqListType Date[MAX_SIZE];//一个char类型的数组
    size_t size;//size_t为无符号长整型，，顺序表中有效元素的个数
}SeqList;//结构体的别名



void SeqListPrint(SeqList* pseq);//输出函数
void SeqListInit(SeqList *pseq);//初始化
void SeqListPopStart(SeqList *pseq, SeqListType value);//头部插入一个元素
void SeqListPushStart(SeqList *pseq);//头部删除一个元素
void SeqListPushEnd(SeqList *pseq);//尾部删除一个元素
void SeqListPopEnd(SeqList *pseq, SeqListType value);//尾部插入一个元素
void SeqListPushValue(SeqList *pseq, SeqListType value);//按值删除一个元素
void SeqListPushX(SeqList *pseq, int count);//按下标删除一个元素
void SeqListSearchX(SeqList *pseq, int count);//按下标查找一个元素
size_t SeqListSearchZ(SeqList *pseq, SeqListType value);//按值查找一个元素
int  SeqListCount(SeqList *pseq);//得到顺序表的个数
void SeqListEmpty(SeqList *pseq);//判断顺序表是否为空
void SeqListBubbleSort(SeqList *pseq, int(*swap)(SeqListType *, SeqListType *));//用冒泡排序排序顺序表
void SeqListSelectSort(SeqList *pseq, int(*swap)(SeqListType *, SeqListType *));//用选择排序排序顺序表
int SeqListBinarySearch(SeqList *pseq, SeqListType value);//二分查找顺序表
void SeqListChange(SeqList *pseq, SeqListType value, SeqListType cvalue);//将value元素改为cvalue

SeqList seq;//定义了一个结构体变量
//SeqList *pseq = &seq;//定义了一个结构体指针保存seq变量的地址

顺序表的一些操作

#define _CRT_SECURE_NO_WARNINGS 1
#include<assert.h>
#include"1.h"

/************************初始化函数*************************/
void SeqListInit(SeqList *pseq)
{
    assert(pseq);
    pseq->size = 0;
}

/*************************打印顺序表************************/
void SeqListPrint(SeqList *pseq)
{
    size_t i = 0;
    for (i = 0; i < pseq->size; i++)
    {
        printf("%p---->%c\n", &pseq->Date[i], pseq->Date[i]);
    }
}
/********************给顺序表头部插入一个数据****************/


void SeqListPopStart(SeqList *pseq,char value)
{
    size_t i = 0;
    if (pseq->size == MAX_SIZE)
    {
        return;
    }
    else
    {
        ++pseq->size;
        for (i = pseq->size - 1; i > 0; i--)
        {
            pseq->Date[i] = pseq->Date[i - 1];
        }
        pseq->Date[i] = value;
    }
}

/*******************给头部删除一个元素******************/
void SeqListPushStart(SeqList *pseq)
{
    size_t i = 0;
    if (pseq->size == 0)
    {
        return;
    }
    else
    {
        for (i = 0; i < pseq->size; i++)
        {
            pseq->Date[i] = pseq->Date[i + 1];
        }
        --pseq->size;
    }
}

/*******************给尾部删除一个元素******************/
void SeqListPushEnd(SeqList *pseq)
{
    if (pseq->size == 0)
    {
        return;
    }
    else
    {
        --pseq->size;
    }
}

/*******************给尾部插入一个元素******************/
void SeqListPopEnd(SeqList *pseq, SeqListType value)
{
    if (pseq->size >= MAX_SIZE)
    {
        return;
    }
    else
    {
        pseq->Date[pseq->size] = value;
        ++pseq->size;
    }

}
/***按值删除一个元素，若有重复的元素只删除第一个*******/
void SeqListPushValue(SeqList *pseq, SeqListType value)
{
    size_t i = 0;
    size_t j = 0;
    if (pseq->size == 0)
    {
        return;
    }
    else
    {
        for (i = 0; i < pseq->size; i++)
        {
            if (value == pseq->Date[i])
            {
                for (j = i; j < pseq->size; j++)
                {
                    pseq->Date[j] = pseq->Date[j + 1];
                }
                --pseq->size;
                break;
            }
        }
    }
}
/******************按下标删除一个元素******************/
void SeqListPushX(SeqList *pseq, int count)
{
    size_t i=count;
    if (pseq->size == 0)
    {
        return;
    }
    else
    {
        for (; i < pseq->size; i++)
        {
            pseq->Date[i] = pseq->Date[i + 1];
        }
    }
    --pseq->size;
}

/******************按下标查找一个元素******************/
void SeqListSearchX(SeqList *pseq, int count)
{
    if (pseq->size == 0)
    {
        return;
    }
    else
    {
        printf("%d下标所对的值为：%c", count,pseq->Date[count]);
    }
}
/******************按值查找一个元素******************/
size_t SeqListSearchZ(SeqList *pseq, SeqListType value)
{
    size_t i = 0;
    for (; i < pseq->size; ++i)
    {
        if (pseq->Date[i] == value)
        {
            return i;
        }
    }
    return - 1;
}

/******************得到顺序表元素个数******************/
int SeqListCount(SeqList *pseq)
{
    size_t i = 0;
    int count = 0;
    for (; i < pseq->size; i++)
    {
        count++;
    }
    return count;
}

/*****************判断该顺序表是否为空******************/
void SeqListEmpty(SeqList *pseq)
{
    size_t i = 0;
    int count = 0;
    for (; i < pseq->size; i++)
    {
        count++;
    }
    if (count == 0)
    {
        printf("顺序表为空！！");
    }
    else
    {
        printf("顺序表不为空！！");
    }
}

/*****************顺序表的冒泡排序******************/
void swap(SeqListType *left , SeqListType *right)
{
    SeqListType tmp = *left;
    *left = *right;
    *right = tmp;
}
void SeqListBubbleSort(SeqList *pseq, int(*swap)(SeqListType *, SeqListType *))
{
    size_t i = 0;
    size_t j = 0;
    for (i = 0; i < pseq->size - 1; i++)
    {
        for (j = 0; j < pseq->size - 1 - i; j++)
        {
            if (pseq->Date[j] < pseq->Date[j + 1])//由大到小排序
            {
                swap(&pseq->Date[j], &pseq->Date[j + 1]);
            }
        }
    }
}
/*****************顺序表的选择排序******************/

void SeqListSelectSort(SeqList *pseq, int(*swap)(SeqListType *, SeqListType *))
{
    size_t i = 0;
    size_t j = 0;
    for (i = 0; i < pseq->size - 1; i++)
    {
        size_t max = i;
        for (j = i + 1; j < pseq->size; j++)
        {
            if (pseq->Date[max] > pseq->Date[j])//从小到大排序
            {
                max = j;
            }
        }
        swap(&pseq->Date[max], &pseq->Date[i]);
    }
}

/******************二分查找一个元素******************/
int SeqListBinarySearch(SeqList *pseq, SeqListType value)
{
    int left = 0;
    int count = SeqListCount(&seq);
    int right = count - 1;
    while (left <= right)
    {
        int mid = left + (right - left) / 2;
        if (pseq->Date[mid] > value)
        {
            right = mid - 1;
        }
        else if (pseq->Date[mid] < value)
        {
            left = mid + 1;
        }
        else
        {
            return mid;
        }
    }
    return -1;
}

void SeqListChange(SeqList *pseq, SeqListType value, SeqListType cvalue)
{
    size_t i = 0;
    for (i = 0; i < pseq->size; i++)
    {
        if (pseq->Date[i] == value)
        {
            pseq->Date[i] = cvalue;
        }
    }
}

这些函数的一些测试用例

//测试程序
void SeqListPopStartTest(SeqList *pseq)
{
    printf("****************头部插入元素**************\n");
    SeqListInit(&seq);
    SeqListPopStart(&seq, 'a');
    SeqListPopStart(&seq, 'b');
    SeqListPopStart(&seq, 'c');
    SeqListPopStart(&seq, 'd');
    SeqListPopStart(&seq, 'z');
    SeqListPopStart(&seq, 'x');
    SeqListPopStart(&seq, 'u');

    SeqListPrint(&seq);
}

void SeqListPushStartTest(SeqList *pseq)
{
    printf("****************头部删除元素**************\n");
    SeqListPushStart(&seq);
    SeqListPrint(&seq);
}

void SeqListPushEndTest(SeqList *pseq)
{
    printf("****************尾部删除元素**************\n");
    SeqListPushEnd(&seq);
    SeqListPrint(&seq);
}
void SeqListPopEndTest(SeqList *pseq)
{
    printf("****************尾部插入元素**************\n");

    SeqListPopEnd(&seq,'e');
    SeqListPopEnd(&seq,'q');
    SeqListPrint(&seq);
}

void SeqListPushValueTest(SeqList *pseq)
{
    printf("****************按值删除元素**************\n");
    SeqListPushValue(&seq, 'e');
    SeqListPrint(&seq);
}

void SeqListPushXTest(SeqList *pseq)
{
    printf("****************按下标删除元素*************\n");
    SeqListPushX(&seq, 2);
    SeqListPrint(&seq);
}

void SeqListSearchXTest(SeqList *pseq)
{
    printf("****************按下标查找元素*************\n");
    SeqListPrint(&seq);
    SeqListSearchX(&seq, 1);

}
void SeqListSearchZTest(SeqList *pseq)
{
    printf("****************按值查找元素**************\n");
    SeqListPrint(&seq);
    size_t count = SeqListSearchZ(&seq, 'c');
    if (count == -1)
    {
        printf("没有找到该值！！！");
    }
    else
    {
        printf("该值所对应的元素下标为：%ld", count);
    }
}

void SeqListCountTest(SeqList *pseq)
{
    printf("****************得到顺序表元素个数*********\n");
    int count = SeqListCount(&seq);
    printf("该顺序表元素个数为：%d", count);
}

void SeqListEmptyTest(SeqList *pseq)
{
    printf("****************判断顺序表是否为空*********\n");
    SeqListEmpty(&seq);
}



void SeqListBubbleSortTest(SeqList *pseq)
{
    printf("****************冒泡排序排顺序表***********\n");
    SeqListBubbleSort(&seq, swap);
    SeqListPrint(&seq);
}


void SeqListSelectSortTest(SeqList *pseq)
{
    printf("****************选择排序排顺序表***********\n");
    SeqListSelectSort(&seq, swap);
    SeqListPrint(&seq);
}

void SeqListBinarySearchTest(SeqList *pseq)
{
    printf("****************二分查找顺序表***************\n");
    int num=SeqListBinarySearch(&seq, 'b');
    if (num == -1)
    {
        printf("没找到该值！！");
    }
    else
    {
        printf("该值对应的下标为：%d", num);
    }

}
void SeqListChangeTest(SeqList *pseq)
{
    printf("****************按值修改顺序表***************\n");
    SeqListChange(&seq, 'x', 'f');
    SeqListPrint(&seq);
}

主函数对测试函数进行调用

#define _CRT_SECURE_NO_WARNINGS 1
#include"1.h"
int main()
{

    SeqListInit(&seq);//对该结构体变量进行初始化(取该结构体变量的地址)
    SeqListPopStartTest(&seq);//头插一个元素
    printf("\n");
    printf("\n");
    SeqListPushStartTest(&seq);//头删
    printf("\n");
    printf("\n");
    SeqListPushEndTest(&seq);//尾删
    printf("\n");
    printf("\n");
    SeqListPopEndTest(&seq);//尾插
    printf("\n");
    printf("\n");
    SeqListPushValueTest(&seq);//按值删除元素
    printf("\n");
    printf("\n");
    SeqListPushXTest(&seq);//按下标删除
    printf("\n");
    printf("\n");
    SeqListSearchXTest(&seq);//按下标查找元素返回对应元素
    printf("\n");
    printf("\n");
    SeqListSearchZTest(&seq);//按值查找，返回对应元素的下标
    printf("\n");
    printf("\n");
    SeqListCountTest(&seq);//计算顺序表元素个数
    printf("\n");
    printf("\n");
    SeqListEmptyTest(&seq);//判断是否为空
    printf("\n");
    printf("\n");
    SeqListBubbleSortTest(&seq);//冒泡排序
    printf("\n");
    printf("\n");
    SeqListSelectSortTest(&seq);//选择排序
    printf("\n");
    printf("\n");
    SeqListBinarySearchTest(&seq);//二分查找
    printf("\n");
    printf("\n");
    SeqListChangeTest(&seq);


    system("pause");
    return 0;
}

互相交流！！！若是发现有什么错误，希望可以及时指出！！感谢大佬们~^-^