#include<stdio.h>

int order(arr[])

{

int x;

int num;

printf ("你輸入的數(shù)字是\n");

scanf ("%d",&x);

for (i=0, i<=6, i++)

{

if (arr[i] == x)

{

num = i;

}

else

{

num = -1;

}

}

return num;

}

int main()

{

int arr[7] = {1,3,5,7,8,2,4};

int index = order(arr);

if (index != -1)

{

printf ("%d在該數(shù)組內(nèi)存在,為%d號(hào)", x, index);

}

else

{

printf("%d在該數(shù)組內(nèi)部存在", x);

}

return 0;

}