c语言 线性搜索

给出一列数，找一个数，并告诉位置

#include <stdio.h>
int main()
{
	//引入一个数组 
	int a[]={1,2,3,4,5,6,7,8,9,45,54,123,25,32};
	int r = rearch(45,a,sizeof(a)/sizeof(a[0]));
	printf("%d",r);
	return 0;
}

int rearch(int key,int prime[],int len)
{
	int ret = -1;
	for (int i = 0;i<len;i++)
	{
		if (prime[i] == key)
		{
			ret = i;
			break;
		}
	}
	return ret;
}