Two ways to search an entry in an array.

#include<stdio.h>
#define n 5
int search1(int key,int a[],int cnt){
	int i,result=-1;
	for(i=0;i<cnt;i++){
		if(a[i]==key){
			result=i;
			break;
		}
	}	
	return result;
}
int search2(int key,int a[],int cnt){  //only if the array is in order
	int upper=cnt-1;
	int lower=0;
	int i,
	while(upper>=lower){
		i=(upper+lower)/2;             //each time get a new i to do the later comparation
		if(a[i]>key) upper=i-1;        //two exits:upper<lower;find
		else if(a[i]<key) lower=i+1;
		else return i;
	}
	return -1;
}
int main(void){
	int i,a[n],key;
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	scanf("%d",&key);
	if(search1(key,a,n)==-1) printf("NOT FIND %d",key);
	else printf("Find %d at a[%d]",key,search1(key,a,n));
}