数据结构作业

作业：1>顺序表按元素删除

               1.根据删除的元素得到下标

               2.根据下标实现[按下标删除]

          2>顺序表排序[类似数组排序]

1、head.h

#ifndef N
#define N
#define MAXSIZE 7
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef int datatype;
typedef struct
{
	//顺序表元素
	datatype data[MAXSIZE];
	//顺序表长度
	int len;
}seqlist;
seqlist *create();
int full(seqlist *list);
int  insert(seqlist *list,datatype e);  //输入
void output(seqlist *list);       //输出
int empt(seqlist *list);
int search(seqlist *list,datatype e);  //查找
int delete(seqlist *list,int sub);       //按下标删除
int delete_data(seqlist *list,datatype key);  //按元素删除
void bubble(seqlist *list);

#endif

2、main.c

#include"head.h"

int main(int argc, const char *argv[])
{
	int n;
	printf("请输入元素的个数：");
	scanf("%d",&n);
	seqlist *list=create();
	datatype e;
	for(int i=0;i<n;i++)
	{
		printf("请输入您要插入的值：");
		scanf("%d",&e);
		insert(list,e);
	}
	output(list);
	datatype key;
	printf("请输入您要删除的值");
	scanf("%d",&key);
	delete_data(list,key);
	output(list);
	bubble(list);
	output(list);
	
	return 0;
}

3、test.c

#include"head.h"
//在堆区申请空间
seqlist *create()
{
	seqlist *list=(seqlist *)malloc(sizeof(seqlist));
	if(list==NULL)
		return NULL;
	list->len=0;
	return list;
}
int full(seqlist *list)
{
	return list->len==MAXSIZE?-1:0;
}
int  insert(seqlist *list,datatype e)  //输入
{
	if(full(list))
		return -1;
	list->data[list->len]=e;
	list->len++;
	return 0;
}
void output(seqlist *list)       //输出
{
	puts("");
	for(int i=0;i<list->len;i++)
	{
		printf("%d\t",list->data[i]);
	}
	puts("");
}
int empt(seqlist *list)
{
	return list->len==0?-1:0;
}
int search(seqlist *list,datatype e)  //查找
{
	for(int i=0;i<list->len;i++)
	{
		if(list->data[i]==e)
		{
			return i;
		}
	}
	return -1;
}
int delete(seqlist *list,int sub)       //按下标删除
{
	if(empt(list)||sub<0||sub>=list->len)
	{
		printf("删除失败\n");
		return -1;
	}
	for(int i=sub+1;i<list->len;i++)
	{
		list->data[i-1]=list->data[i];
	}
	list->len--;
	return 0;
}
int delete_data(seqlist *list,datatype key)  //按元素删除
{
	int sub=search(list,key);
	if(sub==-1)
	{
		printf("删除失败\n");
		return -1;
	}
	delete(list,sub);
	return 0;
}
void bubble(seqlist *list)            //冒泡排序
{
	for(int i=1;i<list->len;i++)
	{	
			int count=0;
			for(int j=0;j<list->len-i;j++)
		{
			if(list->data[j]>list->data[j+1])
			{
				int t=list->data[j];
				list->data[j]=list->data[j+1];
				list->data[j+1]=t;
				count++;
			}
		}
			if(count==0)
				break;
		}
}