Binary Search

#include<stdio.h>

int binarysearch(int array[],int n,int key){
    int low = 0;
    int high = n - 1;
	while(low <= high){
		int mid = low + (high - low) / 2;
		if(array[mid] == key){
		    return mid + 1;
		}else if(array[mid] > key){
			high = mid - 1;
		}else{
			low = mid + 1;
		}
	}
	return -1;
}
int main(){
	int array[] = {12,13,27,38,39,44,58,62};
	int key = 39;
	int position = binarysearch(array,8,key);
	if(position==-1){
		printf("Not Found");
	}else{
		printf("Found On %d",position);
	}
	return 0;
}

Copy