1 #include
2 #include
3 #include
4 int search(int key, int a[], int length);
5 int main()
6 {
7 // int a[13] ={ [1]=2,4,[5]=6}; //稀疏的元素
8 //int i;
9 int loc;
10 int a[]={2,4,6,7,9,11,13,23,14,32};
11 //printf("%d\n", sizeof(a));
12 //printf("%d\n", sizeof(a[0]));
13 int x;
14 printf("请输入一个数字:");
15 scanf("%d", &x);
16 loc = search(x, a, sizeof(a)/sizeof(a[0]));
17 if (loc != -1)
18 {
19 printf("%d在第%d的位置上\n", x, loc);
20 }else{
21 printf("%d不存在\n",x);
22 }
23
24 //for(i =0; i
25 // printf("%d ", a[i]);
26 //}
27 return 0;
28 }
29
30 int search(int key, int a[], int length)
31 {
32 int ret = -1;
33 int i;
34 for(i=0; i
35 if(a[i] == key){
36 ret = i;
37 break;
38 }
39 }
40 return ret;
41 }
标签:loc,13,int,C语言,查找,数组,printf,sizeof,include
来源: https://www.cnblogs.com/0422hao/p/10877528.html