#include<stdio.h>
//顺序查找
int Sequentialsearch(int *p,int target ,int num)
{
int pos = 0;
for(pos = 0; pos <= num;pos ++)
{
if(p[pos] == target )
{
return pos+1;
}
}
return 1;
}
//逆序查找
int Sequentialsearch_r(int *p,int target ,int num)
{
int pos = num;
for(pos = num - 1; pos >= 0;pos --)
{
if(p[pos] == target )
{
return pos+1;
}
}
return 1;
}
//折半查找
int halfsearch(int *p,int target ,int low ,int hig)
{
int pos = 0;
while(low <= hig)
{
int mid = ( low + hig ) / 2;
if(p[pos] = target)
{
return mid;
}
else if(p[pos] > target )
{
hig = mid - 1;
}
else if(p[pos] < target)
{
low = mid + 1;
}
}
return 1;
}
void main()
{
int i[12] = {65,85,78,15,25,36,554,98,55554,74,54,8888};
int j[12] = {10,20,30,40,50,60,70,80,90,100,110,120};
int src=Sequentialsearch_r(i,36,11);
printf("%d\n",src);
// int res = halfsearch(j, 80 , 0 ,12);
// printf("%d\n",res);
}