1>顺序表按元素删除
2>顺序表排序【类似数组排序】
代码
头文件
#ifndef __HEAD_H__
#define __HEAD_H__
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MAXSIZE 7 //宏定义线性表长度
typedef int datatype;//把int起别名datatype
//定义顺序表:数据元素,顺序表长度
typedef struct
{
//数据元素
datatype data[MAXSIZE];
//顺序表长度
int len;
}seqlist;
seqlist *create();
int full_seqlist(seqlist *list);
int insert_rear(seqlist *list,datatype e);
void output(seqlist *list);
int empty_seqlist(seqlist *list);
int delete_rear(seqlist *list);
int search_sub(seqlist *list,int sub);
int update_sub(seqlist *list,int sub,datatype e);
int insert_sub(seqlist *list,int sub,datatype e);
int delete_sub(seqlist *list,int sub);
int search_e(seqlist *list,datatype e);
int delete_e(seqlist *list,datatype e);
void bubble(seqlist *list);
#endif
主函数
#include "head.h"
int main(int argc, const char *argv[])
{
seqlist *list=create();
//循环尾部插入
int n=0;
datatype e;
printf("输入数据元素个数:");
scanf("%d",&n);
for(int i=0;i<n;i++){
printf("输入插入的值:");
scanf("%d",&e);
insert_rear(list,e);
}
//输出
output(list);
//查找
int sub;
printf("输入要查找的下标:");
scanf("%d",&sub);
search_sub(list,sub);
//修改
printf("输入要修改的下标:");
scanf("%d",&sub);
printf("输入要修改的值:");
scanf("%d",&e);
update_sub(list,sub,e);
output(list);
//插入
printf("输入要插入的下标:");
scanf("%d",&sub);
printf("输入要插入的值:");
scanf("%d",&e);
insert_sub(list,sub,e);
output(list);
//删除
printf("输入要删除的下标:");
scanf("%d",&sub);
delete_sub(list,sub);
output(list);
//按元素查找
printf("输入要查找的元素:");
scanf("%d",&e);
int i=search_e(list,e);
if(i>0){
printf("查找元素下标为:%d\n",i);
}else{
printf("没有此元素\n");
}
//按元素删除
printf("输入要删除的元素:");
scanf("%d",&e);
delete_e(list,e);
output(list);
//顺序表排序
bubble(list);
printf("排序结果为:");
output(list);
return 0;
}
自定义函数
#include "head.h"
//堆区申请顺序表
seqlist *create()
{
seqlist *list=(seqlist *)malloc(sizeof(seqlist));
if(list==NULL)
return NULL;
list->len=0;//把顺序表长度清零
return list;
}
//判断顺序表满的函数
int full_seqlist(seqlist *list)
{
return list->len==MAXSIZE?-1:0;
}
//尾部插入
int insert_rear(seqlist *list,datatype e)
{
if(full_seqlist(list)){ //if(full_seqlist(list)==-1)
printf("顺序表已满\n");
return -1;
}
list->data[list->len]=e;
list->len++;
return 0;
}
//循环输出
void output(seqlist *list)
{
for(int i=0;i<list->len;i++){
printf("%d ",list->data[i]);
}
printf("\n");
}
//判断顺序表空的函数
int empty_seqlist(seqlist *list)
{
return list->len==0?-1:0;
}
//尾部删除
int delete_rear(seqlist *list)
{
if(empty_seqlist(list)){
printf("顺序表为空\n");
return -1;
}
list->len--;
return 0;
}
//查找
int search_sub(seqlist *list,int sub)
{
if(empty_seqlist(list)||sub<0||sub>=list->len){
printf("顺序表查找失败\n");
return -1;
}
printf("%d\n",list->data[sub]);
return 0;
}
//修改
int update_sub(seqlist *list,int sub,datatype e)
{
if(empty_seqlist(list)||sub<0||sub>=list->len){
printf("顺序表修改失败\n");
return -1;
}
list->data[sub]=e;
return 0;
}
//插入
int insert_sub(seqlist *list,int sub,datatype e)
{
if(full_seqlist(list)||sub<0||sub>list->len){
printf("顺序表插入失败\n");
return -1;
}
for(int i=list->len-1;i>=sub;i--){
list->data[i+1]=list->data[i];
}
list->data[sub]=e;
list->len++;
return 0;
}
//删除
int delete_sub(seqlist *list,int sub)
{
if(empty_seqlist(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 search_e(seqlist *list,datatype e)
{
for(int i=0;i<list->len;i++){
if(list->data[i]==e){
return i;
}
}
return -1;
}
//按元素删除
int delete_e(seqlist *list,datatype e)
{
int sub=search_e(list,e);
if(sub==-1){
printf("没有此元素,删除失败\n");
return -1;
}
delete_sub(list,sub);
return 0;
}
//顺序表排序
void bubble(seqlist *list)
{
int count=0;
for(int i=1;i<list->len;i++){
count=0;
for(int j=0;j<(list->len)-i;j++){
if(list->data[j]>list->data[j+1]){
datatype temp=list->data[j];
list->data[j]=list->data[j+1];
list->data[j+1]=temp;
count++;
}
}
if(count==0)
break;
}
}