fork download
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. //この関数を実装する
  5. int binary_search(int a[],int n,int x){
  6. int lef=0,rig=n-1,mid=(lef+rig)/2;
  7. while(1){
  8. if(a[mid]==x){
  9. return mid;
  10. break;
  11. }
  12. else if(a[mid]<x){
  13. lef=mid+1;
  14. mid=(lef+rig)/2;
  15. }
  16. else if(a[mid]>x){
  17. rig=mid-1;
  18. mid=(lef+rig)/2;
  19. }
  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 5424KB
stdin
12 5
1 2 3 4 5 8 9 13 16 21 25 27
stdout
a[4] = 5