方法一：
int main(){
int arr[] = { 1, 4, 2, 5, 3, 7, 8 };
int to_find = 5;
int i = 0;
for (i = 0; i < sizeof(arr) / sizeof(arr[0]); ++i)
{
if (to_find == arr[i])
break;
}
if (i < sizeof(arr) / sizeof(arr[0])){
printf("找到了,下标为:%d\n", i);
}
else{
printf("找不到\n");
}
return 0;
}
方法二：
int Find(int arr[],int size, int to_find){
int i = 0;
for (; i < size; ++ i){
if (arr[i] == to_find){
return i;
}
}
return -1;
}
int main(){
int arr[] = { 9, 5, 2, 7, 6, 10 };
int to_find = 2;
int size = sizeof(arr) / sizeof(arr[0]);
int i = Find(arr,size, to_find);
if (i == -1){
printf("没找到%d\n");
}
else{
printf("找到了,下标是%d\n", i);
}
return 0;
}