C語言-查找一個元素在數組中的位置

#include<stdio.h>
#include <stdlib.h>
#include <time.h>
int search(int key, int a[], int length);
int main()
{
   // int a[13] ={ [1]=2,4,[5]=6}; //稀疏的元素
    //int i;
    int loc;
    int a[]={2,4,6,7,9,11,13,23,14,32};
    //printf("%d\n", sizeof(a));
    //printf("%d\n", sizeof(a[0]));
    int x;
    printf("請輸入一個數字：");
    scanf("%d", &x);
    loc = search(x, a, sizeof(a)/sizeof(a[0]));
    if (loc != -1)
    {
        printf("%d在第%d的位置上\n", x, loc);
    }else{
        printf("%d不存在\n",x);
    }

    //for(i =0; i<sizeof(a)/sizeof(a[0]);i++){
       // printf("%d ", a[i]);
    //}
    return 0;
}

int search(int key, int a[], int length)
{
    int ret = -1;
    int i;
    for(i=0; i<length; i++){
        if(a[i] == key){
            ret = i;
            break;
        }
    }
    return ret;
}