binary search in c
//C Implementation #include<stdio.h> int BinarySearch(int arr[], int search, int mid, int len){ if(mid == -1 || mid == len+1){ printf("\nSearched Element doesn't exist."); return 1; } else if (search > arr[mid]){ mid++; BinarySearch(arr,search,mid,len); return 0; } else if (search < arr[mid]){ mid--; BinarySearch(arr,search,mid,len); return 0; } else if(search == arr[mid]) { printf("\n Searched Element found at Location %d.",mid); return 1; } } void main(){ int arr[] = {1,2,3,4,5,6,7,8,9}; int len = sizeof(arr) / sizeof(int); int mid = (int) (len / 2) + 1; printf("\n Please Enter Number You Want to Search \n > "); int search; scanf("%d",&search); int Result = BinarySearch(arr,search,mid,len); }
