顺序表SeqList

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 PushFront(pSeqList ps, DataType d);			//前插
void PopFront(pSeqList ps);							//前删

void PrintSeqList(pSeqList ps);					//打印				
int Find(pSeqList ps, DataType d);				//查找目标元素并返回下标
void Insert(pSeqList ps, int pos, DataType d);		//在该下标位置插入一个元素
void Erase(pSeqList ps, int pos);					//删除该下标所指元素
void Remove(pSeqList ps, DataType d);				//删除目标元素
void RemoveAll(pSeqList ps, DataType d);			//删除所有目标元素
void BubbleSort(pSeqList ps);						//冒泡排序
int BinarySearch(pSeqList ps, DataType d);			//二分查找

SeqList.c

#include "SeqList.h"
void PrintSeqList(pSeqList ps)
{
	int i = 0;
	assert(ps != NULL);
	for (i = 0; i<ps->sz; i++)
	{
		printf("%d ", ps->data[i]);
	}
	printf("\n");
}

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)
	{
		printf("表已满");
		return;
	}
	ps->data[ps->sz] = d;
	ps->sz++;
}

void PushFront(pSeqList ps, DataType d)
{
	int i = 0;
	assert(ps);
	if (ps->sz == MAX)
	{
		printf("表已满");
		return;
	}
	for (i = ps->sz; i>0; i--)
	{
		ps->data[i] = ps->data[i - 1];
	}
	ps->data[0] = d;
	ps->sz++;
}

void PopBack(pSeqList ps)
{
	assert(ps);
	if (ps->sz == 0)
	{
		printf("表为空");
		return;
	}
	ps->sz--;
}

void PopFront(pSeqList ps)
{
	assert(ps);
	if (ps->sz != 0)
	{
		int i = 0;
		for (i = 0; i<ps->sz; 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, int pos, DataType d)
{
	int i = 0;
	assert(ps);
	if (ps->sz == MAX)
	{
		printf("表已满");
		return;
	}
	for ( i = ps->sz; i > pos ; i--)
	{
		ps->data[i] = ps->data[i - 1];
	}
	ps->data[pos] = d;
	ps->sz++;
}

void Erase(pSeqList ps, int pos)
{
	int i = 0;
	assert(ps);
	if (ps->sz == 0)
	{
		printf("表为空");
		return;
	}
	for (i = pos; i < ps->sz - 1; i++)
	{
		ps->data[i] = ps->data[i + 1];
	}
	ps->sz--;
}

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


void RemoveAll(pSeqList ps, DataType d)
{
	int i = 0;
	int j = 0;
	assert(ps);
	for ( i = 0; i < ps->sz; i++)
	{
		if (ps->data[i] == d)
		{
			for (j = i; j < ps->sz - 1; j++)
			{
				ps->data[j] = ps->data[j + 1];
			}
			ps->sz--;
			i--;
		}
	}
}
void BubbleSort(pSeqList ps)
{
	int i = 0;
	int j = 0;
	int tmp = 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])
			{
				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])
		{
			left = mid + 1;
		}
		else if (d < ps->data[mid])
		{
			right = mid - 1;
		}
		else
		{
			return mid;
		}
	}
	return -1;
}