C++数据结构 动态分配的顺序表 按值查找

//动态分配  按值查找
#include <stdio.h>
#include <malloc.h>

#define initsize 10

typedef struct {
	int* data;
	int length;
	int maxsize;
}seqlist;

void initlist(seqlist &l) {
	//1.开辟一个连续的空间
	l.data = (int*)malloc(initsize * sizeof(int));
	//2.
	l.length = 0;
	//3.
	l.maxsize = initsize;
}

int insertlist(seqlist l,int e) {
	for (int i = 0; i < l.length; i++)
	{
		if (l.data[i] == e) return i + 1;
	}
	return 0;
}

int main() {
	//1.声明一个动态分配的顺序表
	seqlist l;
	//2.初始化
	initlist(l);
	//3.赋值
	for (int  i = 0; i < l.maxsize-2; i++)
	{
		l.data[i] = i + 2;
		l.length++;
	}
	//4.查看
	for (int i = 0; i < l.length; i++)
	{
		printf("开始L.data[%d]=%d\n", i,l.data[i]);
	}

	//5.按值查找
	int e=5;
	int i = insertlist(l, e);
	printf("查找的值:%d在第%d位", e,i);
	return 0;
}