1，顺序表
#include <stdio.h>
#define MAX_SIZE 50
typedef struct {
int data[MAX_SIZE];
int cur_size;
}SqList;
/**
* @brief 插入
*/
void SQ_list_insert(SqList *L, int i, int e)
{
if (L->cur_size != 0)
{
for (int j = L->cur_size - 1; j <= i - 1; j--) {
L->data[j+1] = L->data[j];
}
}
L->data[i-1] = e;
}
/**
* @brief 初始化
* @param L
*/
void SQ_list_init(SqList *L)
{
for (int i = 0; i < MAX_SIZE; ++i) {
L->data[i] = 0;
}
L->cur_size = 0;
}
/**
* @brief 输入一个值，查找其位序
* @param L
* @param element
* @return
*/
int SQ_list_find_index(SqList L, int element)
{
for (int i = 0; i < L.cur_size; ++i) {
if (L.data[i] == element)
{
return i+1;
}
}
}
int main()
{
SqList List_1;
SQ_list_init(&List_1);
SQ_list_insert(&List_1, 2, 20);
return 0;
}
