1 数组

数组是顺序存储，具有时间优越性。

用数组实现简单的哈希表

int GetSize(int data[])
{
	return sizeof(data);
}

int _tmain(int argc, _TCHAR* argv[])
{
	int data1[] = {1, 2, 3, 4, 5};
	int size1 = sizeof(data1);
	int *data2 = data1;
	int size2 = sizeof(data2)

	int size3 = GetSize(data1);

	printf("%d, %d, %d", size1, size2, size3);
}	

标签：size1,size2,int,基础知识,数组,sizeof,数据结构,data1
来源： https://blog.csdn.net/Hollybobo79/article/details/84259312