//第3回 課題1
#include <stdio.h>
#include <stdlib.h>
//この関数を実装する
int binary_search(int a[],int n,int x){
int ret = -1;
int lef,mid,rig;
lef = 0;
rig = n-1;
while(lef <= rig){
mid = (lef + rig) /2;
//printf("%d %d %d :%d\n",lef,mid,rig,a[mid]);
if(a[mid] == x) {
ret = mid;
break;
}
if(x < a[mid]) rig = mid-1;
else lef = mid+1;
}
return ret;
}
int main(void) {
int n,x,i;
int *a;
int ans = -1;
a
= (int*)malloc(sizeof(int)*n
); if(a==NULL){
return -1;
}
for(i=0;i<n;i++){
}
ans = binary_search(a,n,x);
if(ans
!= -1) printf("a[%d] = %d\n",ans
,a
[ans
]); return 0;
}
Ly/nrKwz5ZueIOiqsumhjO+8kQojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgogCi8v44GT44Gu6Zai5pWw44KS5a6f6KOF44GZ44KLCmludCBiaW5hcnlfc2VhcmNoKGludCBhW10saW50IG4saW50IHgpewogICBpbnQgcmV0ID0gLTE7CglpbnQgbGVmLG1pZCxyaWc7CglsZWYgPSAwOwoJcmlnID0gbi0xOwoJd2hpbGUobGVmIDw9IHJpZyl7CgkJbWlkID0gKGxlZiArIHJpZykgLzI7CgkJLy9wcmludGYoIiVkICVkICVkIDolZFxuIixsZWYsbWlkLHJpZyxhW21pZF0pOwoJCWlmKGFbbWlkXSA9PSB4KSB7CgkJCXJldCA9IG1pZDsKCQkJYnJlYWs7CgkJfQoJCWlmKHggPCBhW21pZF0pIAlyaWcgPSBtaWQtMTsKCQllbHNlIAkJCQlsZWYgPSBtaWQrMTsKCX0KCXJldHVybiByZXQ7Cn0KCiAKaW50IG1haW4odm9pZCkgewoJaW50IG4seCxpOwoJaW50ICphOwoJaW50IGFucyA9IC0xOwoJc2NhbmYoIiVkICVkIiwmbiwmeCk7CglhID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpKm4pOwoJaWYoYT09TlVMTCl7CgkJcHJpbnRmKCJFUlJPUlxuIik7CgkJcmV0dXJuIC0xOwoJfQoJZm9yKGk9MDtpPG47aSsrKXsKCQlzY2FuZigiJWQiLCZhW2ldKTsKCX0KCWFucyA9IGJpbmFyeV9zZWFyY2goYSxuLHgpOwoJaWYoYW5zICE9IC0xKSBwcmludGYoImFbJWRdID0gJWRcbiIsYW5zLGFbYW5zXSk7CgllbHNlIHByaW50Zigibm90IGZvdW5kXG4iKTsKCWZyZWUoYSk7CglyZXR1cm4gMDsKfQ==