//查找排序(顺序查找)一个表长100的顺序存储表,要求使用顺序查找列表中的元素并输出
#include <stdio.h>
#define SIZE 150 //100长度
typedef int Datatype;
struct Seqlist
{
Datatype data[SIZE];
int Length;
};
void ListLength(struct Seqlist *list,int x)//表长
{
int sum = 0;
for (int i = 0; i < x; i++)
{
list->data[i]=sum;
printf("%d\t",list->data[i]);
sum++;
}
}
int LocatNode(struct Seqlist *list,int b)//寻找元素
{
for (int i = 0; i < list->Length; i++)
{
if (b == list->data[i])
printf("第%d个元素是%d\n",i,list->data[i]);
}
return -1;
}
void initList(struct Seqlist *list)//初始化
{
list->Length=0;
}
int main(int argc, const char * argv[])
{
// insert code here...
struct Seqlist list;
initList(&list);//初始化
int num;
printf("请输入数字最大范围:");
scanf("%d",&num);
list.Length=num;
ListLength(&list,num);
// 查找第a个元素并输出
int a =0;
printf("请输入要查找数的下标");
scanf("%d",&a);
LocatNode(&list,a);
}