//第3回 課題1
#include <stdio.h>
#include <stdlib.h>
//この関数を実装する
int binary_search(int a[],int n,int x){
int lef = 0;
int rig = n-1;
while (lef <= rig)
{
int mid = (lef + rig)/2;
if (a[mid] == x)
{
return mid;
}
else if (a[mid] < x)
{
lef = mid + 1;
}
else
{
rig = mid - 1;
}
}
return -1;
}
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+8kQojaW5jbHVkZSA8c3RkaW8uaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgoKLy/jgZPjga7plqLmlbDjgpLlrp/oo4XjgZnjgosKaW50IGJpbmFyeV9zZWFyY2goaW50IGFbXSxpbnQgbixpbnQgeCl7CglpbnQgbGVmID0gMDsKICAgIGludCByaWcgPSBuLTE7Cgl3aGlsZSAobGVmIDw9IHJpZykgCgl7CgkJaW50IG1pZCA9IChsZWYgKyByaWcpLzI7CgkJaWYgKGFbbWlkXSA9PSB4KQoJCXsgICAKCQkJcmV0dXJuIG1pZDsKCQl9CgkJZWxzZSBpZiAoYVttaWRdIDwgeCkKCQl7CiAgICAgICAgICAgIGxlZiA9IG1pZCArIDE7CiAgICAgICAgfQoJCWVsc2UKCQl7CiAgICAgICAgICAgIHJpZyA9IG1pZCAtIDE7CiAgICAgICAgfQoJfQogcmV0dXJuIC0xOwp9CgppbnQgbWFpbih2b2lkKSB7CglpbnQgbix4LGk7CglpbnQgKmE7CglpbnQgYW5zID0gLTE7CglzY2FuZigiJWQgJWQiLCZuLCZ4KTsKCWEgPSAoaW50KiltYWxsb2Moc2l6ZW9mKGludCkqbik7CglpZihhPT1OVUxMKXsKCQlwcmludGYoIkVSUk9SXG4iKTsKCQlyZXR1cm4gLTE7Cgl9Cglmb3IoaT0wO2k8bjtpKyspewoJCXNjYW5mKCIlZCIsJmFbaV0pOwoJfQoJYW5zID0gYmluYXJ5X3NlYXJjaChhLG4seCk7CglpZihhbnMgIT0gLTEpIHByaW50ZigiYVslZF0gPSAlZFxuIixhbnMsYVthbnNdKTsKCWVsc2UgcHJpbnRmKCJub3QgZm91bmRcbiIpOwoJZnJlZShhKTsKCXJldHVybiAwOwp9Cg==