binrec.c

#include<stdio.h>
void sort(int *ar,int n){
	int temp;
	for(int i=0;i<n;i++){
		for(int j=0;j<n-i-1;j++){
			if(ar[j]>ar[j+1]){
				temp=ar[j];
				ar[j]=ar[j+1];
				ar[j+1]=temp;	
				}
			}				
		}
	}
void binsearch(int *ar,int low,int upp,int key){

	if(low>upp){
		printf("Element not found");
		return;
	}
	int mid=(low+upp)/2;
	if(key>ar[mid]) binsearch(ar,mid+1,upp,key);
	else if(key<ar[mid]) binsearch(ar,low,mid-1,key);
	else printf("Element found at position %d",mid+1);
			
}	


	
		
		

void main(){
	int arr[100],i,n,key;
	printf("Enter the size of the array(<50):");
	scanf("%d",&n);
	for(i=0;i<n;i++){
		printf("Enter element %d:",i+1);
		scanf("%d",&arr[i]);	
	}
	
	

	
	sort(arr,n);	
	printf("Enter the element to be searched:");
	scanf("%d",&key);
	binsearch(arr,0,n-1,key);
}