fork download
copy 
  1.  
  2. //第3回 課題１
  3. #include <stdio.h>
  4. #include <stdlib.h>
  5.  
  6. //この関数を実装する
  7. int binary_search(int a[],int n,int x){
  8.  
  9.     int i,ret = -1;
  10.     int min = 0;
  11.     int max = n - 1;
  12.     int mid;
  13.  
  14.     while (min <= max) {
  15.         int mid = (min + max) / 2;
  16.         if (a[mid] == x) {
  17.             return 0;
  18.         } else {
  19.             return ret;
  20.         }
  21.     }
  22. }
  23.  
  24. int main(void) {
  25. 	int n,x,i;
  26. 	int *a;
  27. 	int ans = -1;
  28. 	scanf("%d %d",&n,&x);
  29. 	a = (int*)malloc(sizeof(int)*n);
  30. 	if(a==NULL){
  31. 		printf("ERROR\n");
  32. 		return -1;
  33. 	}
  34. 	for(i=0;i<n;i++){
  35. 		scanf("%d",&a[i]);
  36. 	}
  37. 	ans = binary_search(a,n,x);
  38. 	if(ans != -1) printf("a[%d] = %d\n",ans,a[ans]);
  39. 	else printf("not found\n");
  40. 	free(a);
  41. 	return 0;
  42. }
Success #stdin #stdout 0.01s 5304KB
comments (?)
stdin
copy 
12　5
stdout
copy 
not found
https://ideone.com/3kU20S
language:
C (gcc 8.3)
created:
236 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!