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

//动态分配 按位查找
#include 
#include 
#define initsize 10

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

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

int searchlist(seqlist l,int i) {
	return l.data[i - 1];
}

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

	//5.按位查找
	int i;
	i = searchlist(l, 4);
	printf("动态分配的按位查找：%d", i);
	return 0;
}