fork download
  1. //Q65. Search in a sorted array using binary search.
  2. #include <stdio.h>
  3. int main() {
  4. int n,a[100],x,l=0,h,mid;
  5. scanf("%d",&n);
  6. for(int i=0;i<n;i++) scanf("%d",&a[i]);
  7. scanf("%d",&x);
  8. h=n-1;
  9. while(l<=h){
  10. mid=(l+h)/2;
  11. if(a[mid]==x){ printf("Found at %d",mid+1); return 0; }
  12. else if(a[mid]<x) l=mid+1;
  13. else h=mid-1;
  14. }
  15. printf("Not found");
  16. }
  17.  
Success #stdin #stdout 0s 5292KB
stdin
5
1 3 5 7 9
7
stdout
Found at 4