//Q65. Search in a sorted array using binary search.
#include <stdio.h>
int main() {
int n,a[100],x,l=0,h,mid;
for(int i
=0;i
<n
;i
++) scanf("%d",&a
[i
]); h=n-1;
while(l<=h){
mid=(l+h)/2;
if(a
[mid
]==x
){ printf("Found at %d",mid
+1); return 0; } else if(a[mid]<x) l=mid+1;
else h=mid-1;
}
}
Ly9RNjUuIFNlYXJjaCBpbiBhIHNvcnRlZCBhcnJheSB1c2luZyBiaW5hcnkgc2VhcmNoLgojaW5jbHVkZSA8c3RkaW8uaD4KaW50IG1haW4oKSB7CiAgICBpbnQgbixhWzEwMF0seCxsPTAsaCxtaWQ7CiAgICBzY2FuZigiJWQiLCZuKTsKICAgIGZvcihpbnQgaT0wO2k8bjtpKyspIHNjYW5mKCIlZCIsJmFbaV0pOwogICAgc2NhbmYoIiVkIiwmeCk7CiAgICBoPW4tMTsKICAgIHdoaWxlKGw8PWgpewogICAgICAgIG1pZD0obCtoKS8yOwogICAgICAgIGlmKGFbbWlkXT09eCl7IHByaW50ZigiRm91bmQgYXQgJWQiLG1pZCsxKTsgcmV0dXJuIDA7IH0KICAgICAgICBlbHNlIGlmKGFbbWlkXTx4KSBsPW1pZCsxOwogICAgICAgIGVsc2UgaD1taWQtMTsKICAgIH0KICAgIHByaW50ZigiTm90IGZvdW5kIik7Cn0K