C program to binary search

C program to binary search

Output:

Enter the size of the array:
5
Enter the elements of array in sorted order:
1 2 3 4 5
Enter the element to search:
5
Element found

Implementation:

#include <stdio.h> #define MAX 1000000 int binarysearch(int arr[],int l,int n,int key) { int mid; mid=(l+n)/2; if(l>n) return; if(key==arr[mid]) return 1; else if(key<arr[mid]) return binarysearch(arr,l,mid-1,key); else if(key>arr[mid]) return binarysearch(arr,mid+1,n,key); else return 0; } int main(void) { int arr[MAX],i,n,element; printf("Enter the size of the array:\n"); scanf("%d",&n); printf("Enter the elements of array in sorted order:\n"); for(i=0;i<n;i++) { scanf("%d",&arr[i]); } printf("Enter the element to search:\n"); scanf("%d",&element); if(binarysearch(arr,0,n,element)) printf("Element found"); else printf("Element not found"); return 0; }