数据结构:
typedef struct Seqlist//顺序表
{
DataType data[MAX];
int sz;
} Seqlist,*pSeqlist;
方法:
void InitSeqlist(pSeqlist ps);//初始化
void PushBack(pSeqlist ps, DataType d);//尾插
void PrintSeqlist(pSeqlist ps);//打印
void PopBack(pSeqlist ps);//尾删
void PushFront(pSeqlist ps,DataType d);//头插
void PopFront(pSeqlist ps);//头删
void Insert(pSeqlist ps, int pos,DataType d);//指定位置插入
int Find(pSeqlist ps, DataType d);//遍历查找
void Remove(pSeqlist ps, DataType d);//删除
void ReverseSeqlist(pSeqlist ps);//逆序
void SortSeqlist(pSeqlist ps);//冒泡排序
int BinarySearch(pSeqlist ps, DataType d);//二分查找
代码实现:
test.c
#include"Seqlist.h"
void test()
{
Seqlist seqlist;
int ret = 0;
InitSeqlist(&seqlist);//初始化
PushBack(&seqlist, 1);//尾插
PushBack(&seqlist, 2);
PushBack(&seqlist, 3);
PushBack(&seqlist, 4);
PrintSeqlist(&seqlist);//打印
PopBack(&seqlist);//尾删
PopBack(&seqlist);
PrintSeqlist(&seqlist);
PushFront(&seqlist, 0);//头插
PrintSeqlist(&seqlist);
PopFront(&seqlist);//头删
PrintSeqlist(&seqlist);
Insert(&seqlist, 1, 5);//指定位置插入
PrintSeqlist(&seqlist);
ret = Find(&seqlist, 5);
printf("ret = %d\n", ret);
Remove(&seqlist, 5);//删除
PrintSeqlist(&seqlist);
}
void test2()
{
Seqlist seqlist;
int ret = 0;
InitSeqlist(&seqlist);//初始化
PushBack(&seqlist, 1);//尾插
PushBack(&seqlist, 2);
PushBack(&seqlist, 3);
PushBack(&seqlist, 4);
ReverseSeqlist(&seqlist);//逆序
SortSeqlist(&seqlist);//排序
PrintSeqlist(&seqlist);
ret = BinarySearch(&seqlist, 2);//二分查找
printf("ret = %d\n", ret);
}
int main()
{
test2();
return 0;
}
Seqlist.h
#ifndef __SEQLIST_H__
#define __SEQLIST_H__
#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<string.h>
#define MAX 100
#define FORMAT "%d "//输出格式
typedef int DataType;
typedef struct Seqlist//顺序表
{
DataType data[MAX];
int sz;
} Seqlist,*pSeqlist;
void InitSeqlist(pSeqlist ps);//初始化
void PushBack(pSeqlist ps, DataType d);//尾插
void PrintSeqlist(pSeqlist ps);//打印
void PopBack(pSeqlist ps);//尾删
void PushFront(pSeqlist ps,DataType d);//头插
void PopFront(pSeqlist ps);//头删
void Insert(pSeqlist ps, int pos,DataType d);//指定位置插入
int Find(pSeqlist ps, DataType d);//遍历查找
void Remove(pSeqlist ps, DataType d);//删除
void ReverseSeqlist(pSeqlist ps);//逆序
void SortSeqlist(pSeqlist ps);//冒泡排序
int BinarySearch(pSeqlist ps, DataType d);//二分查找
#endif//__SEQLIST_H__
Seqlist.c
#include"Seqlist.h"
void InitSeqlist(pSeqlist ps)//初始化
{
int i = 0;
assert(ps != NULL);
memset(ps, 0, sizeof(Seqlist));
ps->sz = 0;
}
void PushBack(pSeqlist ps,DataType d)//尾插
{
assert(ps != NULL);
if (ps->sz == MAX)
{
printf("顺序表已满,追加失败!\n");
//exit(EXIT_FAILURE);
}
else
{
ps->data[ps->sz] = d;
ps->sz++;
//printf("追加成功!\n");
}
}
void PrintSeqlist(pSeqlist ps)//打印
{
int i = 0;
assert(ps != NULL);
for (i = 0; i < ps->sz; i++)
{
printf(FORMAT, ps->data[i]);
}
printf("\n");
}
void PopBack(pSeqlist ps)//尾删
{
assert(ps != NULL);
if (ps->sz == 0)
{
printf("顺序表为空,尾删失败!\n");
}
else
{
ps->data[ps->sz - 1] = 0;
ps->sz--;
//printf("尾删成功!\n");
}
}
void PushFront(pSeqlist ps, DataType d)//头插
{
int i = 0;
assert(ps != NULL);
for (i = ps->sz; i > 0; i--)
{
ps->data[i] = ps->data[i - 1];
}
ps->data[0] = d;
ps->sz++;
//printf("头插成功!\n");
}
void PopFront(pSeqlist ps)//头删
{
assert(ps != NULL);
if (ps->sz == 0)
{
printf("顺序表为空,头删失败!\n");
}
else
{
int i = 0;
for (i = 1; i < ps->sz; i++)
{
ps->data[i - 1] = ps->data[i];
}
ps->sz--;
//printf("头删成功!\n");
}
}
void Insert(pSeqlist ps,int pos, DataType d)//指定位置插入
{
pos--;
assert(ps != NULL);
if (ps->sz == MAX)
{
printf("顺序表已满,插入失败!\n");
}
else
{
if ((pos<0) || (pos>ps->sz))
{
printf("输入下标错误!\n");
}
else if (pos == ps->sz)
{
ps->data[pos] = d;
ps->sz++;
//printf("插入成功!\n");
}
else
{
int i = 0;
for (i = ps->sz; i > pos; i--)
{
ps->data[i] = ps->data[i - 1];
}
ps->data[pos] = d;
ps->sz++;
//printf("插入成功!\n");
}
}
}
int Find(pSeqlist ps, DataType d)//遍历寻找
{
int i = 0;
assert(ps != NULL);
for (i = 0; i < ps->sz; i++)
{
if (ps->data[i] == d)
{
return i;
}
}
return -1;
}
void Remove(pSeqlist ps, DataType d)//删除
{
int ret = 0;
assert(ps != NULL);
ret = Find(ps, d);
if (ret == -1)
{
printf("未找到此元素!\n");
}
else
{
int i = 0;
for (i = ret; i < ps->sz-1; i++)
{
ps->data[i] = ps->data[i + 1];
}
ps->sz--;
//printf("删除成功!\n");
}
}
void ReverseSeqlist(pSeqlist ps)//逆序
{
int left = 0;
int right = 0;
DataType tmp = 0;
assert(ps != NULL);
right = ps->sz - 1;
while (left < right)
{
tmp = ps->data[left];
ps->data[left] = ps->data[right];
ps->data[right] = tmp;
left++;
right--;
}
}
void SortSeqlist(pSeqlist ps)//排序
{
int i = 0;
int j = 0;
DataType tmp = 0;
assert(ps != NULL);
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])
{
tmp = ps->data[j];
ps->data[j] = ps->data[j + 1];
ps->data[j + 1] = tmp;
}
}
}
}
int BinarySearch(pSeqlist ps, DataType d)//二分查找
{
int left = 0;
int right = 0;
int mid = 0;
assert(ps != NULL);
right = ps->sz - 1;
while (left <= right)
{
mid = left + ((right - left) >> 2);
if (ps->data[mid] > d)
{
right = mid - 1;
}
else if (ps->data[mid] < d)
{
left = mid + 1;
}
else
{
return mid;
}
}
return -1;
}