一.小知识
转载请附上:https://blog.csdn.net/qq_37978862/article/details/104590347
算法的设计:逻辑结构
算法的实现:存储结构
简单介绍:
二.举例
#include<stdio.h>
#include<stdlib.h>
#define MAX 100
typedef int data_t;
typedef struct
{
data_t data[MAX];
int last;
}seqlist;
//创建顺序表
seqlist* get_create()
{
seqlist* s = (seqlist *)malloc(sizeof(seqlist));
return s;
}
//求顺序表长度
int seq_length(seqlist *s)
{
return(s->last);
}
//判空
int seq_empty(seqlist* s)
{
return(s->last == 0);
}
//判满
int seq_full(seqlist *s)
{
return(s->last == MAX);
}
//按位置插入(pose代表下标)
int position_insert(seqlist* s,int pose,data_t n)
{
//判断位置是否合法
if( seq_full(s) || pose<