fork download
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int binary_search(int a[],int n,int x){
  5. int ret = -1;
  6. int lef,mid,rig;
  7. lef = 0;
  8. rig = n-1;
  9. while(lef <= rig){
  10. mid = (lef + rig) /2;
  11. //printf("%d %d %d :%d\n",lef,mid,rig,a[mid]);
  12. if(a[mid] == x) {
  13. ret = mid;
  14. break;
  15. }
  16. if(x < a[mid]) rig = mid-1;
  17. else lef = mid+1;
  18. }
  19. return ret;
  20. }
  21.  
  22.  
  23. int main(void) {
  24. int n,x,i;
  25. int *a;
  26. int ans = -1;
  27. scanf("%d %d",&n,&x);
  28. a = (int*)malloc(sizeof(int)*n);
  29. if(a==NULL){
  30. printf("ERROR\n");
  31. return -1;
  32. }
  33. for(i=0;i<n;i++){
  34. scanf("%d",&a[i]);
  35. }
  36. ans = binary_search(a,n,x);
  37. if(ans != -1) printf("a[%d] = %d\n",ans,a[ans]);
  38. else printf("not found\n");
  39. free(a);
  40. return 0;
  41. }
Success #stdin #stdout 0s 5320KB
stdin
12 5
1 2 3 4 5 8 9 13 16 21 25 27
stdout
a[4] = 5