【c语言】c语言实现顺序表（静态）

//头文件

//seqlist.h
#ifndef __SEQLIST_H__ 
#define __SEQLIST_H__ 

#include<stdio.h> 
#include <string.h>
#include <stdlib.h>
#include <assert.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
#define _CRT_SECURE_NO_WARNINGS
#include"seqlist.h"
void InitSeqList(pSeqList ps)
{
	assert(ps);
	ps -> sz = 0;
	memset(ps->data, 0, sizeof(ps->data));
}
void PushBack(pSeqList ps, DataType d)
{
	assert(ps);
	if (ps->sz == MAX)
	{
		return;
	}
	ps->data[ps->sz] = d;
	ps->sz++;

}
void PopBack(pSeqList ps)
{
	assert(ps);
	if (ps->sz == 0 )
	{
		return;
	}
	ps->sz--;
}
void Display(const pSeqList ps)
{
	int i = 0;
	assert(ps);
	for ( i = 0; i < ps->sz; i++)
	{
		printf("%d ", ps->data[i]);
	}
	printf("\n");
}
void PushFront(pSeqList ps, DataType d)
{	
	assert(ps);
	if (ps->sz == MAX)
	{
		return;
	}
	memmove(ps->data + 1, ps->data, sizeof(DataType)*(ps->sz));
	/*int i = 0;
	for	( i = ps->sz; i > 0; i--)
	{
		ps->data[i] = ps->data[i - 1];

	}*/
	ps->data[0] = d;
	ps->sz++;
}
void PopFront(pSeqList ps)
{
	int i = 0;
	assert(ps);
	if (ps->sz == 0)
	{
		return;
	}
	for (i = 0; i < ps->sz-1; i++)
	{
		ps->data[i] = ps->data[i + 1];
	}
	ps->sz--;
	
}
int Find(pSeqList ps, DataType d)
{
	int i = 0;
	assert(ps);
	for ( i = 0; i < ps->sz; i++)
	{
		if (ps->data[i] == d)
		{
			return i;
		}
		
	}
	return -1;
}
void Insert(pSeqList ps, DataType d, int pos)
{
	int i = 0;
	assert(ps);
	if (ps->sz == MAX)
	{
		return;
	}
	for (i = ps->sz; i > pos; i--)
	{
		ps->data[i] = ps->data[i - 1];

	}
	ps-> data[pos] = d;
	ps -> sz++;
}
void Remove(pSeqList ps, DataType d)//任意位置删除
{
	int pos = Find(ps, d);

	assert(ps);
	if (ps->sz == 0)
	{
		return;
	}
	for ( int i = pos;  i < ps->sz-1;  i++)
	{
		ps->data[i] = ps->data[i + 1];
	}
	ps->sz--;
}
void RemoveAll(pSeqList ps, DataType d)//
{
	int pos = 0;
	assert(ps);
	while ((pos = Find(ps, d)) != -1)
	{
		Remove(ps, d);
	}
	

}
void Reverse(pSeqList ps)//逆序
{
	DataType* left = ps->data;
	DataType* right = ps->data + ps->sz - 1;
	while (left <right)
	{
		DataType tmp = *left;
		*left = *right;
		*right = tmp;
		left++;
		right--;
	}
}
void Sort(pSeqList ps)//排序
{
	int i = 0;
	int j = 0;
	assert(ps);
	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)//二分查找
{
	int left = 0;
	int right = ps->sz-1;
	
	assert(ps);
	while (left <= right)
	{
		int mid = left + ((right - left) >> 1);
		if (d == ps->data[mid])
		{
			return mid;
		}
		else if (d < ps->data[mid])
		{
			right = mid-1;
		}
		else
		{
			left = mid+1;
		}
		
	}
	return -1;
}

//测试函数
//test.c
#include "seqlist.h"
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);

}
void test2()
{
	SeqList my_list;
	InitSeqList(&my_list);
	PushFront(&my_list, 1);
	PushFront(&my_list, 2);
	PushFront(&my_list, 3);
	PushFront(&my_list, 4);
	Display(&my_list);
	PopFront(&my_list);
	Display(&my_list);
	PopFront(&my_list);
	Display(&my_list); 
	PopFront(&my_list);
	Display(&my_list);
}
void test3()
{
	int pos = 0;
	SeqList my_list;
	InitSeqList(&my_list);
	PushFront(&my_list, 1);
	
	PushFront(&my_list, 2);
	PushFront(&my_list, 3);
	PushFront(&my_list, 4);
	PushFront(&my_list, 5);
	Display(&my_list);
	pos = Find(&my_list, 4);
	if (pos == -1)
	{
		printf("没找到\n");
	}
	else
	{
		Insert(&my_list, 6, pos);
	}
	Display(&my_list);
	Remove(&my_list, 4);
	RemoveAll(&my_list, 4);
	Reverse(&my_list);
	Sort(&my_list);
	Display(&my_list);
	pos = BinarySearch(&my_list, 4);
	printf("%d\n", pos);
	pos = BinarySearch(&my_list, 7);
	printf("%d\n", pos);
	//Display(&my_list);
	


	
}
int main()
{
	test3();
	system("pause");
	return 0;
}