#include <stdio.h> int binary_search(int arr[],int l,int h,int key) { if(l<=h){ int mid=(l+h)/2; if(arr[mid]==key) return mid; if(arr[mid]>key){ return binary_search(arr,l,mid-1,key); return binary_search(arr,mid+1,h,key); } } return -1; } int bubblesort(int arr[],int n) { int i,j,temp; for(i=0;i<n-1;i++){ for(j=0;j<n-i-1;j++){ if(arr[j]>arr[j+1]){ temp=arr[j]; arr[j]=arr[j+1]; arr[j+1]=temp; } } } return temp; } void printarr(int arr[],int n){ int i; for(i=0;i<n;i++){ printf("%d",arr[i]); } } int main(){ int n,i,arr[7],key; printf("enter the element size\n"); scanf("%d",&n); printf("enter the element you want to sort\n"); for(i=0;i<n;i++){ scanf("%d\n",&arr[i]); } bubblesort(arr,n); printarr(arr,n); printf("\nEnter the element you want to search"); scanf("%d",&key); int result=binary_search(arr,0,n-1,key); if (result==-1){ printf("element not found"); return 0; } printf("element found at %d position",result); return 0; }