带哨兵的顺序查找

#include "stdio.h"
//Search_Seq搜索序列 
int Search_Seq(int A[], int key, int length){
      
     int i;
     
	 A[0] = key;                        //将数组A的第一个元素设置为key的值 
     for (i = length; A[i]!=key; --i);	//顺序查找算法在数组A中查找键值key	
     return i;                                         
}

void Show_Result(int result,int testkey)
{
	if(result==0)
		printf("%d\n",testkey);
	else
		printf("未找到%d\n",testkey,result);
	return;
}
void main()
{
	int A[8]={0,1,2,4,6,8,7,9};
	
	int testkey1=7,testkey2=200;
	int result;
	
	result = Search_Seq(A,testkey1,7);
	Show_Result(result,testkey1);
	
	result = Search_Seq(A,testkey2,7);
	Show_Result(result,testkey2);
}